./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/triangular-longest-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0de0d7c7-431f-427a-b773-43b8eeafd32a/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_0de0d7c7-431f-427a-b773-43b8eeafd32a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0de0d7c7-431f-427a-b773-43b8eeafd32a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0de0d7c7-431f-427a-b773-43b8eeafd32a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/triangular-longest-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0de0d7c7-431f-427a-b773-43b8eeafd32a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0de0d7c7-431f-427a-b773-43b8eeafd32a/bin/utaipan --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 37b183961076d6fcb23260763ff12b2e8c94306b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-28 07:28:11,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 07:28:11,353 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 07:28:11,404 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 07:28:11,405 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 07:28:11,411 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 07:28:11,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 07:28:11,422 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 07:28:11,425 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 07:28:11,427 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 07:28:11,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 07:28:11,431 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 07:28:11,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 07:28:11,440 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 07:28:11,442 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 07:28:11,445 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 07:28:11,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 07:28:11,452 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 07:28:11,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 07:28:11,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 07:28:11,466 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 07:28:11,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 07:28:11,470 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 07:28:11,471 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 07:28:11,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 07:28:11,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 07:28:11,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 07:28:11,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 07:28:11,481 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 07:28:11,482 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 07:28:11,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 07:28:11,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 07:28:11,488 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 07:28:11,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 07:28:11,491 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 07:28:11,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 07:28:11,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 07:28:11,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 07:28:11,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 07:28:11,495 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 07:28:11,496 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 07:28:11,498 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0de0d7c7-431f-427a-b773-43b8eeafd32a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-28 07:28:11,539 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 07:28:11,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 07:28:11,540 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-28 07:28:11,541 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-28 07:28:11,541 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-28 07:28:11,541 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-28 07:28:11,542 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-28 07:28:11,542 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-28 07:28:11,542 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-28 07:28:11,542 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-28 07:28:11,543 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-28 07:28:11,544 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-28 07:28:11,544 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-28 07:28:11,544 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-28 07:28:11,545 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-28 07:28:11,545 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 07:28:11,546 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 07:28:11,546 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 07:28:11,546 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 07:28:11,546 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 07:28:11,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 07:28:11,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 07:28:11,547 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 07:28:11,547 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-28 07:28:11,548 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 07:28:11,548 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 07:28:11,548 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 07:28:11,548 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 07:28:11,549 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 07:28:11,549 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 07:28:11,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 07:28:11,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 07:28:11,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 07:28:11,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 07:28:11,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 07:28:11,551 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-28 07:28:11,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 07:28:11,551 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 07:28:11,551 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 07:28:11,552 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-28 07:28:11,552 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-vcloud-master/worker/run_dir_0de0d7c7-431f-427a-b773-43b8eeafd32a/bin/utaipan/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-vcloud-master/worker/run_dir_0de0d7c7-431f-427a-b773-43b8eeafd32a/bin/utaipan 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 -> 37b183961076d6fcb23260763ff12b2e8c94306b [2020-11-28 07:28:11,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 07:28:11,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 07:28:11,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 07:28:11,871 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 07:28:11,871 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 07:28:11,873 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0de0d7c7-431f-427a-b773-43b8eeafd32a/bin/utaipan/../../sv-benchmarks/c/pthread/triangular-longest-1.i [2020-11-28 07:28:11,947 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0de0d7c7-431f-427a-b773-43b8eeafd32a/bin/utaipan/data/a17c8f62f/3eaba2bf40114634a290d33a2bb4a06c/FLAG9d1d99686 [2020-11-28 07:28:12,573 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 07:28:12,574 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0de0d7c7-431f-427a-b773-43b8eeafd32a/sv-benchmarks/c/pthread/triangular-longest-1.i [2020-11-28 07:28:12,589 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0de0d7c7-431f-427a-b773-43b8eeafd32a/bin/utaipan/data/a17c8f62f/3eaba2bf40114634a290d33a2bb4a06c/FLAG9d1d99686 [2020-11-28 07:28:12,885 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0de0d7c7-431f-427a-b773-43b8eeafd32a/bin/utaipan/data/a17c8f62f/3eaba2bf40114634a290d33a2bb4a06c [2020-11-28 07:28:12,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 07:28:12,889 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 07:28:12,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 07:28:12,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 07:28:12,895 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 07:28:12,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:28:12" (1/1) ... [2020-11-28 07:28:12,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5308ed68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:28:12, skipping insertion in model container [2020-11-28 07:28:12,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:28:12" (1/1) ... [2020-11-28 07:28:12,905 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 07:28:12,951 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 07:28:13,391 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 07:28:13,400 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 07:28:13,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 07:28:13,506 INFO L208 MainTranslator]: Completed translation [2020-11-28 07:28:13,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:28:13 WrapperNode [2020-11-28 07:28:13,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 07:28:13,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 07:28:13,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 07:28:13,508 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 07:28:13,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:28:13" (1/1) ... [2020-11-28 07:28:13,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:28:13" (1/1) ... [2020-11-28 07:28:13,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 07:28:13,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 07:28:13,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 07:28:13,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 07:28:13,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:28:13" (1/1) ... [2020-11-28 07:28:13,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:28:13" (1/1) ... [2020-11-28 07:28:13,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:28:13" (1/1) ... [2020-11-28 07:28:13,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:28:13" (1/1) ... [2020-11-28 07:28:13,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:28:13" (1/1) ... [2020-11-28 07:28:13,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:28:13" (1/1) ... [2020-11-28 07:28:13,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:28:13" (1/1) ... [2020-11-28 07:28:13,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 07:28:13,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 07:28:13,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 07:28:13,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 07:28:13,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:28:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0de0d7c7-431f-427a-b773-43b8eeafd32a/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 07:28:13,671 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-11-28 07:28:13,671 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-11-28 07:28:13,671 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-11-28 07:28:13,671 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-11-28 07:28:13,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 07:28:13,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-28 07:28:13,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 07:28:13,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 07:28:13,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 07:28:13,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-28 07:28:13,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 07:28:13,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 07:28:13,676 WARN L208 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-28 07:28:14,168 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 07:28:14,168 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-11-28 07:28:14,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:28:14 BoogieIcfgContainer [2020-11-28 07:28:14,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 07:28:14,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 07:28:14,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 07:28:14,176 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 07:28:14,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 07:28:12" (1/3) ... [2020-11-28 07:28:14,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3325bbbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:28:14, skipping insertion in model container [2020-11-28 07:28:14,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:28:13" (2/3) ... [2020-11-28 07:28:14,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3325bbbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:28:14, skipping insertion in model container [2020-11-28 07:28:14,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:28:14" (3/3) ... [2020-11-28 07:28:14,179 INFO L111 eAbstractionObserver]: Analyzing ICFG triangular-longest-1.i [2020-11-28 07:28:14,191 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-28 07:28:14,191 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 07:28:14,196 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-28 07:28:14,197 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-28 07:28:14,228 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,228 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,229 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,229 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,230 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,230 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,231 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,231 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,232 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,232 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,233 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,233 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,233 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,234 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,234 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,234 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,235 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,236 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,236 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,237 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,237 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,238 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,238 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,239 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,241 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,241 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,242 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,243 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,245 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,245 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,246 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,246 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,247 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,247 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,252 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,252 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,252 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,252 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,252 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,252 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:28:14,254 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-28 07:28:14,267 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-11-28 07:28:14,290 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 07:28:14,290 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 07:28:14,290 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 07:28:14,290 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 07:28:14,290 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 07:28:14,299 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 07:28:14,299 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 07:28:14,299 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 07:28:14,314 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-28 07:28:14,316 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 64 transitions, 138 flow [2020-11-28 07:28:14,318 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 64 transitions, 138 flow [2020-11-28 07:28:14,320 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 65 places, 64 transitions, 138 flow [2020-11-28 07:28:14,357 INFO L129 PetriNetUnfolder]: 6/62 cut-off events. [2020-11-28 07:28:14,358 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-28 07:28:14,362 INFO L80 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 62 events. 6/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2020-11-28 07:28:14,364 INFO L116 LiptonReduction]: Number of co-enabled transitions 1144 [2020-11-28 07:28:16,175 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2020-11-28 07:28:16,566 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2020-11-28 07:28:16,755 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-11-28 07:28:16,767 INFO L131 LiptonReduction]: Checked pairs total: 1062 [2020-11-28 07:28:16,767 INFO L133 LiptonReduction]: Total number of compositions: 60 [2020-11-28 07:28:16,772 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 16 transitions, 42 flow [2020-11-28 07:28:16,782 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2020-11-28 07:28:16,784 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-11-28 07:28:16,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-28 07:28:16,788 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:28:16,789 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-11-28 07:28:16,789 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:28:16,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:28:16,795 INFO L82 PathProgramCache]: Analyzing trace with hash -720017533, now seen corresponding path program 1 times [2020-11-28 07:28:16,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:28:16,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430700952] [2020-11-28 07:28:16,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:28:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:28:17,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:28:17,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430700952] [2020-11-28 07:28:17,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:28:17,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 07:28:17,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750256730] [2020-11-28 07:28:17,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:28:17,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:28:17,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:28:17,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:28:17,045 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2020-11-28 07:28:17,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:28:17,115 INFO L93 Difference]: Finished difference Result 75 states and 190 transitions. [2020-11-28 07:28:17,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 07:28:17,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-11-28 07:28:17,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:28:17,126 INFO L225 Difference]: With dead ends: 75 [2020-11-28 07:28:17,126 INFO L226 Difference]: Without dead ends: 42 [2020-11-28 07:28:17,127 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:28:17,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-28 07:28:17,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-28 07:28:17,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-28 07:28:17,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 98 transitions. [2020-11-28 07:28:17,162 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 98 transitions. Word has length 6 [2020-11-28 07:28:17,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:28:17,162 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 98 transitions. [2020-11-28 07:28:17,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:28:17,163 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 98 transitions. [2020-11-28 07:28:17,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-28 07:28:17,164 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:28:17,164 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:28:17,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 07:28:17,164 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:28:17,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:28:17,165 INFO L82 PathProgramCache]: Analyzing trace with hash -447013893, now seen corresponding path program 1 times [2020-11-28 07:28:17,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:28:17,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381022246] [2020-11-28 07:28:17,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:28:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:28:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:28:17,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381022246] [2020-11-28 07:28:17,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:28:17,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:28:17,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015885173] [2020-11-28 07:28:17,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 07:28:17,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:28:17,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 07:28:17,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:28:17,309 INFO L87 Difference]: Start difference. First operand 42 states and 98 transitions. Second operand 5 states. [2020-11-28 07:28:17,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:28:17,350 INFO L93 Difference]: Finished difference Result 56 states and 130 transitions. [2020-11-28 07:28:17,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 07:28:17,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-11-28 07:28:17,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:28:17,354 INFO L225 Difference]: With dead ends: 56 [2020-11-28 07:28:17,354 INFO L226 Difference]: Without dead ends: 50 [2020-11-28 07:28:17,354 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:28:17,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-11-28 07:28:17,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2020-11-28 07:28:17,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-28 07:28:17,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 100 transitions. [2020-11-28 07:28:17,362 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 100 transitions. Word has length 8 [2020-11-28 07:28:17,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:28:17,363 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 100 transitions. [2020-11-28 07:28:17,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 07:28:17,363 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 100 transitions. [2020-11-28 07:28:17,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-28 07:28:17,364 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:28:17,364 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:28:17,365 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 07:28:17,365 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:28:17,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:28:17,365 INFO L82 PathProgramCache]: Analyzing trace with hash -190894617, now seen corresponding path program 1 times [2020-11-28 07:28:17,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:28:17,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474761612] [2020-11-28 07:28:17,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:28:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:28:17,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:28:17,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474761612] [2020-11-28 07:28:17,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:28:17,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 07:28:17,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283784297] [2020-11-28 07:28:17,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 07:28:17,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:28:17,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 07:28:17,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:28:17,479 INFO L87 Difference]: Start difference. First operand 42 states and 100 transitions. Second operand 6 states. [2020-11-28 07:28:17,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:28:17,601 INFO L93 Difference]: Finished difference Result 54 states and 124 transitions. [2020-11-28 07:28:17,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 07:28:17,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-28 07:28:17,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:28:17,604 INFO L225 Difference]: With dead ends: 54 [2020-11-28 07:28:17,604 INFO L226 Difference]: Without dead ends: 47 [2020-11-28 07:28:17,604 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-11-28 07:28:17,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-28 07:28:17,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2020-11-28 07:28:17,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-11-28 07:28:17,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 106 transitions. [2020-11-28 07:28:17,609 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 106 transitions. Word has length 10 [2020-11-28 07:28:17,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:28:17,610 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 106 transitions. [2020-11-28 07:28:17,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 07:28:17,610 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 106 transitions. [2020-11-28 07:28:17,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-28 07:28:17,611 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:28:17,611 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:28:17,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 07:28:17,611 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:28:17,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:28:17,612 INFO L82 PathProgramCache]: Analyzing trace with hash -83647017, now seen corresponding path program 2 times [2020-11-28 07:28:17,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:28:17,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949388061] [2020-11-28 07:28:17,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:28:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:28:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:28:17,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949388061] [2020-11-28 07:28:17,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:28:17,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 07:28:17,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843834041] [2020-11-28 07:28:17,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 07:28:17,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:28:17,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 07:28:17,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:28:17,709 INFO L87 Difference]: Start difference. First operand 45 states and 106 transitions. Second operand 6 states. [2020-11-28 07:28:17,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:28:17,802 INFO L93 Difference]: Finished difference Result 84 states and 192 transitions. [2020-11-28 07:28:17,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 07:28:17,804 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-28 07:28:17,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:28:17,805 INFO L225 Difference]: With dead ends: 84 [2020-11-28 07:28:17,805 INFO L226 Difference]: Without dead ends: 77 [2020-11-28 07:28:17,806 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-28 07:28:17,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-28 07:28:17,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 47. [2020-11-28 07:28:17,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-28 07:28:17,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 115 transitions. [2020-11-28 07:28:17,827 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 115 transitions. Word has length 10 [2020-11-28 07:28:17,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:28:17,828 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 115 transitions. [2020-11-28 07:28:17,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 07:28:17,828 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 115 transitions. [2020-11-28 07:28:17,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-28 07:28:17,829 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:28:17,829 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:28:17,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 07:28:17,829 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:28:17,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:28:17,830 INFO L82 PathProgramCache]: Analyzing trace with hash -83970657, now seen corresponding path program 3 times [2020-11-28 07:28:17,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:28:17,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22541624] [2020-11-28 07:28:17,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:28:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:28:17,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:28:17,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22541624] [2020-11-28 07:28:17,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:28:17,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 07:28:17,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267112213] [2020-11-28 07:28:17,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 07:28:17,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:28:17,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 07:28:17,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:28:17,925 INFO L87 Difference]: Start difference. First operand 47 states and 115 transitions. Second operand 6 states. [2020-11-28 07:28:18,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:28:18,001 INFO L93 Difference]: Finished difference Result 61 states and 139 transitions. [2020-11-28 07:28:18,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 07:28:18,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-28 07:28:18,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:28:18,003 INFO L225 Difference]: With dead ends: 61 [2020-11-28 07:28:18,003 INFO L226 Difference]: Without dead ends: 50 [2020-11-28 07:28:18,004 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-11-28 07:28:18,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-11-28 07:28:18,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2020-11-28 07:28:18,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-28 07:28:18,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 96 transitions. [2020-11-28 07:28:18,010 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 96 transitions. Word has length 10 [2020-11-28 07:28:18,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:28:18,010 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 96 transitions. [2020-11-28 07:28:18,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 07:28:18,010 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 96 transitions. [2020-11-28 07:28:18,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-28 07:28:18,011 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:28:18,011 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:28:18,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 07:28:18,011 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:28:18,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:28:18,012 INFO L82 PathProgramCache]: Analyzing trace with hash -118912617, now seen corresponding path program 4 times [2020-11-28 07:28:18,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:28:18,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761182550] [2020-11-28 07:28:18,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:28:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:28:18,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:28:18,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761182550] [2020-11-28 07:28:18,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:28:18,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 07:28:18,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361323191] [2020-11-28 07:28:18,114 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 07:28:18,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:28:18,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 07:28:18,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:28:18,115 INFO L87 Difference]: Start difference. First operand 40 states and 96 transitions. Second operand 6 states. [2020-11-28 07:28:18,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:28:18,197 INFO L93 Difference]: Finished difference Result 55 states and 129 transitions. [2020-11-28 07:28:18,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 07:28:18,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-28 07:28:18,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:28:18,202 INFO L225 Difference]: With dead ends: 55 [2020-11-28 07:28:18,202 INFO L226 Difference]: Without dead ends: 49 [2020-11-28 07:28:18,202 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-28 07:28:18,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-11-28 07:28:18,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2020-11-28 07:28:18,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-11-28 07:28:18,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 99 transitions. [2020-11-28 07:28:18,210 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 99 transitions. Word has length 10 [2020-11-28 07:28:18,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:28:18,210 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 99 transitions. [2020-11-28 07:28:18,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 07:28:18,211 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 99 transitions. [2020-11-28 07:28:18,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-28 07:28:18,211 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:28:18,211 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:28:18,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 07:28:18,212 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:28:18,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:28:18,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1691902418, now seen corresponding path program 5 times [2020-11-28 07:28:18,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:28:18,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748178516] [2020-11-28 07:28:18,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:28:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:28:18,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:28:18,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748178516] [2020-11-28 07:28:18,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678426149] [2020-11-28 07:28:18,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0de0d7c7-431f-427a-b773-43b8eeafd32a/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 07:28:18,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-11-28 07:28:18,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 07:28:18,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-28 07:28:18,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 07:28:18,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:28:18,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:28:18,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-28 07:28:18,562 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:28:18,562 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:18,608 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:28:18,608 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:18,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:28:18,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1246424906] [2020-11-28 07:28:18,705 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-28 07:28:18,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-28 07:28:18,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2020-11-28 07:28:18,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847042281] [2020-11-28 07:28:18,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-28 07:28:18,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:28:18,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-28 07:28:18,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-11-28 07:28:18,711 INFO L87 Difference]: Start difference. First operand 41 states and 99 transitions. Second operand 13 states. [2020-11-28 07:28:19,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:28:19,134 INFO L93 Difference]: Finished difference Result 82 states and 197 transitions. [2020-11-28 07:28:19,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-28 07:28:19,135 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2020-11-28 07:28:19,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:28:19,136 INFO L225 Difference]: With dead ends: 82 [2020-11-28 07:28:19,136 INFO L226 Difference]: Without dead ends: 56 [2020-11-28 07:28:19,136 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2020-11-28 07:28:19,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-11-28 07:28:19,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2020-11-28 07:28:19,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-28 07:28:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 97 transitions. [2020-11-28 07:28:19,141 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 97 transitions. Word has length 11 [2020-11-28 07:28:19,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:28:19,141 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 97 transitions. [2020-11-28 07:28:19,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-28 07:28:19,142 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 97 transitions. [2020-11-28 07:28:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 07:28:19,142 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:28:19,150 INFO L422 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:28:19,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-11-28 07:28:19,367 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:28:19,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:28:19,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1230025166, now seen corresponding path program 6 times [2020-11-28 07:28:19,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:28:19,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508816062] [2020-11-28 07:28:19,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:28:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:28:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:28:19,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508816062] [2020-11-28 07:28:19,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987829812] [2020-11-28 07:28:19,498 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0de0d7c7-431f-427a-b773-43b8eeafd32a/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 07:28:19,560 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-28 07:28:19,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 07:28:19,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-28 07:28:19,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 07:28:19,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:28:19,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-28 07:28:19,613 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:28:19,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:19,642 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:19,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:19,702 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:19,719 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:19,742 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:19,770 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:28:19,771 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:19,824 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:28:19,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [927687873] [2020-11-28 07:28:19,826 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-28 07:28:19,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-28 07:28:19,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2020-11-28 07:28:19,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787417733] [2020-11-28 07:28:19,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-28 07:28:19,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:28:19,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-28 07:28:19,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-11-28 07:28:19,828 INFO L87 Difference]: Start difference. First operand 40 states and 97 transitions. Second operand 16 states. [2020-11-28 07:28:20,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:28:20,140 INFO L93 Difference]: Finished difference Result 91 states and 202 transitions. [2020-11-28 07:28:20,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-28 07:28:20,141 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2020-11-28 07:28:20,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:28:20,142 INFO L225 Difference]: With dead ends: 91 [2020-11-28 07:28:20,144 INFO L226 Difference]: Without dead ends: 66 [2020-11-28 07:28:20,144 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2020-11-28 07:28:20,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-11-28 07:28:20,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2020-11-28 07:28:20,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-11-28 07:28:20,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 136 transitions. [2020-11-28 07:28:20,150 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 136 transitions. Word has length 14 [2020-11-28 07:28:20,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:28:20,150 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 136 transitions. [2020-11-28 07:28:20,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-28 07:28:20,151 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 136 transitions. [2020-11-28 07:28:20,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 07:28:20,151 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:28:20,156 INFO L422 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:28:20,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 07:28:20,371 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:28:20,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:28:20,371 INFO L82 PathProgramCache]: Analyzing trace with hash 415819444, now seen corresponding path program 7 times [2020-11-28 07:28:20,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:28:20,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013644456] [2020-11-28 07:28:20,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:28:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:28:20,483 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:28:20,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013644456] [2020-11-28 07:28:20,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057632335] [2020-11-28 07:28:20,483 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0de0d7c7-431f-427a-b773-43b8eeafd32a/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 07:28:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:28:20,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-28 07:28:20,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 07:28:20,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:28:20,633 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:28:20,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-28 07:28:20,635 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:28:20,635 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:20,663 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:28:20,663 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:20,690 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:20,793 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:28:20,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [827706614] [2020-11-28 07:28:20,794 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-28 07:28:20,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-28 07:28:20,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2020-11-28 07:28:20,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187514585] [2020-11-28 07:28:20,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-28 07:28:20,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:28:20,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-28 07:28:20,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2020-11-28 07:28:20,796 INFO L87 Difference]: Start difference. First operand 58 states and 136 transitions. Second operand 17 states. [2020-11-28 07:28:21,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:28:21,403 INFO L93 Difference]: Finished difference Result 157 states and 377 transitions. [2020-11-28 07:28:21,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-28 07:28:21,403 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2020-11-28 07:28:21,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:28:21,404 INFO L225 Difference]: With dead ends: 157 [2020-11-28 07:28:21,404 INFO L226 Difference]: Without dead ends: 108 [2020-11-28 07:28:21,405 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=478, Invalid=1004, Unknown=0, NotChecked=0, Total=1482 [2020-11-28 07:28:21,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-11-28 07:28:21,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 65. [2020-11-28 07:28:21,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-28 07:28:21,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 161 transitions. [2020-11-28 07:28:21,412 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 161 transitions. Word has length 14 [2020-11-28 07:28:21,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:28:21,412 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 161 transitions. [2020-11-28 07:28:21,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-28 07:28:21,412 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 161 transitions. [2020-11-28 07:28:21,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-28 07:28:21,416 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:28:21,416 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:28:21,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 07:28:21,631 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:28:21,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:28:21,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1483738395, now seen corresponding path program 8 times [2020-11-28 07:28:21,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:28:21,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64248974] [2020-11-28 07:28:21,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:28:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:28:21,792 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:28:21,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64248974] [2020-11-28 07:28:21,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877860888] [2020-11-28 07:28:21,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0de0d7c7-431f-427a-b773-43b8eeafd32a/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 07:28:21,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-11-28 07:28:21,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 07:28:21,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-28 07:28:21,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 07:28:21,935 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:28:21,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-28 07:28:21,936 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:28:21,936 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:21,958 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:28:21,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:22,186 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:28:22,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [511716273] [2020-11-28 07:28:22,187 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-28 07:28:22,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-28 07:28:22,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2020-11-28 07:28:22,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335023354] [2020-11-28 07:28:22,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-28 07:28:22,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:28:22,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-28 07:28:22,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2020-11-28 07:28:22,189 INFO L87 Difference]: Start difference. First operand 65 states and 161 transitions. Second operand 25 states. [2020-11-28 07:28:23,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:28:23,234 INFO L93 Difference]: Finished difference Result 210 states and 515 transitions. [2020-11-28 07:28:23,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-11-28 07:28:23,234 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 17 [2020-11-28 07:28:23,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:28:23,236 INFO L225 Difference]: With dead ends: 210 [2020-11-28 07:28:23,236 INFO L226 Difference]: Without dead ends: 129 [2020-11-28 07:28:23,238 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1176, Invalid=2606, Unknown=0, NotChecked=0, Total=3782 [2020-11-28 07:28:23,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-11-28 07:28:23,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 64. [2020-11-28 07:28:23,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-28 07:28:23,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 157 transitions. [2020-11-28 07:28:23,245 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 157 transitions. Word has length 17 [2020-11-28 07:28:23,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:28:23,245 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 157 transitions. [2020-11-28 07:28:23,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-28 07:28:23,245 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 157 transitions. [2020-11-28 07:28:23,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-28 07:28:23,246 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:28:23,246 INFO L422 BasicCegarLoop]: trace histogram [10, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:28:23,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 07:28:23,471 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:28:23,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:28:23,471 INFO L82 PathProgramCache]: Analyzing trace with hash -154578414, now seen corresponding path program 9 times [2020-11-28 07:28:23,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:28:23,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374807235] [2020-11-28 07:28:23,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:28:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:28:23,755 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:28:23,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374807235] [2020-11-28 07:28:23,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929796681] [2020-11-28 07:28:23,755 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0de0d7c7-431f-427a-b773-43b8eeafd32a/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 07:28:23,815 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-28 07:28:23,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 07:28:23,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2020-11-28 07:28:23,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 07:28:23,859 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:28:23,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-28 07:28:23,861 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:28:23,861 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:23,896 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:23,923 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:23,947 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:23,976 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:24,000 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:24,033 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:24,055 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:24,085 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:24,125 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:24,150 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:24,175 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:24,199 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:24,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:24,258 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:24,308 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:24,341 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:24,376 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:24,408 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:28:24,408 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:24,442 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:28:24,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [28550970] [2020-11-28 07:28:24,443 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-28 07:28:24,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-28 07:28:24,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2020-11-28 07:28:24,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389745410] [2020-11-28 07:28:24,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 40 states [2020-11-28 07:28:24,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:28:24,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2020-11-28 07:28:24,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1165, Unknown=0, NotChecked=0, Total=1560 [2020-11-28 07:28:24,446 INFO L87 Difference]: Start difference. First operand 64 states and 157 transitions. Second operand 40 states. [2020-11-28 07:28:25,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:28:25,499 INFO L93 Difference]: Finished difference Result 181 states and 394 transitions. [2020-11-28 07:28:25,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-11-28 07:28:25,499 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 26 [2020-11-28 07:28:25,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:28:25,500 INFO L225 Difference]: With dead ends: 181 [2020-11-28 07:28:25,500 INFO L226 Difference]: Without dead ends: 120 [2020-11-28 07:28:25,502 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1165 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1745, Invalid=3805, Unknown=0, NotChecked=0, Total=5550 [2020-11-28 07:28:25,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-11-28 07:28:25,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 100. [2020-11-28 07:28:25,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-11-28 07:28:25,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 232 transitions. [2020-11-28 07:28:25,509 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 232 transitions. Word has length 26 [2020-11-28 07:28:25,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:28:25,509 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 232 transitions. [2020-11-28 07:28:25,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2020-11-28 07:28:25,509 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 232 transitions. [2020-11-28 07:28:25,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-28 07:28:25,510 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:28:25,510 INFO L422 BasicCegarLoop]: trace histogram [10, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:28:25,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-11-28 07:28:25,715 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:28:25,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:28:25,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1558563116, now seen corresponding path program 10 times [2020-11-28 07:28:25,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:28:25,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551656708] [2020-11-28 07:28:25,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:28:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:28:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:28:25,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551656708] [2020-11-28 07:28:25,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184853980] [2020-11-28 07:28:25,963 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0de0d7c7-431f-427a-b773-43b8eeafd32a/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 07:28:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:28:26,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2020-11-28 07:28:26,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 07:28:26,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:28:26,176 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:28:26,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-28 07:28:26,177 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:28:26,178 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:26,205 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:28:26,205 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:26,223 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:26,638 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:28:26,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1220222434] [2020-11-28 07:28:26,639 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-28 07:28:26,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-28 07:28:26,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 39 [2020-11-28 07:28:26,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544488110] [2020-11-28 07:28:26,640 INFO L461 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-11-28 07:28:26,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:28:26,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-11-28 07:28:26,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=1240, Unknown=0, NotChecked=0, Total=1640 [2020-11-28 07:28:26,641 INFO L87 Difference]: Start difference. First operand 100 states and 232 transitions. Second operand 41 states. [2020-11-28 07:28:29,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:28:29,031 INFO L93 Difference]: Finished difference Result 352 states and 851 transitions. [2020-11-28 07:28:29,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2020-11-28 07:28:29,031 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 26 [2020-11-28 07:28:29,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:28:29,033 INFO L225 Difference]: With dead ends: 352 [2020-11-28 07:28:29,033 INFO L226 Difference]: Without dead ends: 229 [2020-11-28 07:28:29,037 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4112 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3796, Invalid=8414, Unknown=0, NotChecked=0, Total=12210 [2020-11-28 07:28:29,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-11-28 07:28:29,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 104. [2020-11-28 07:28:29,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-11-28 07:28:29,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 254 transitions. [2020-11-28 07:28:29,045 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 254 transitions. Word has length 26 [2020-11-28 07:28:29,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:28:29,045 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 254 transitions. [2020-11-28 07:28:29,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-11-28 07:28:29,045 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 254 transitions. [2020-11-28 07:28:29,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-28 07:28:29,047 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:28:29,047 INFO L422 BasicCegarLoop]: trace histogram [17, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:28:29,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 07:28:29,264 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:28:29,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:28:29,266 INFO L82 PathProgramCache]: Analyzing trace with hash 349348741, now seen corresponding path program 11 times [2020-11-28 07:28:29,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:28:29,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923735345] [2020-11-28 07:28:29,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:28:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:28:29,754 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:28:29,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923735345] [2020-11-28 07:28:29,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937521066] [2020-11-28 07:28:29,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0de0d7c7-431f-427a-b773-43b8eeafd32a/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 07:28:29,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2020-11-28 07:28:29,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 07:28:29,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 35 conjunts are in the unsatisfiable core [2020-11-28 07:28:29,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 07:28:29,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:28:29,941 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:28:29,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-28 07:28:29,942 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:28:29,942 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:29,985 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:28:29,985 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:30,007 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:30,761 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:28:30,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1086428427] [2020-11-28 07:28:30,761 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-28 07:28:30,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-28 07:28:30,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 67 [2020-11-28 07:28:30,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937402340] [2020-11-28 07:28:30,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 69 states [2020-11-28 07:28:30,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:28:30,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2020-11-28 07:28:30,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1096, Invalid=3596, Unknown=0, NotChecked=0, Total=4692 [2020-11-28 07:28:30,765 INFO L87 Difference]: Start difference. First operand 104 states and 254 transitions. Second operand 69 states. [2020-11-28 07:28:33,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:28:33,867 INFO L93 Difference]: Finished difference Result 316 states and 779 transitions. [2020-11-28 07:28:33,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2020-11-28 07:28:33,867 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 40 [2020-11-28 07:28:33,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:28:33,869 INFO L225 Difference]: With dead ends: 316 [2020-11-28 07:28:33,869 INFO L226 Difference]: Without dead ends: 256 [2020-11-28 07:28:33,874 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6731 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=6198, Invalid=14972, Unknown=0, NotChecked=0, Total=21170 [2020-11-28 07:28:33,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-11-28 07:28:33,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 106. [2020-11-28 07:28:33,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-11-28 07:28:33,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 262 transitions. [2020-11-28 07:28:33,888 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 262 transitions. Word has length 40 [2020-11-28 07:28:33,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:28:33,888 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 262 transitions. [2020-11-28 07:28:33,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2020-11-28 07:28:33,889 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 262 transitions. [2020-11-28 07:28:33,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-28 07:28:33,890 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:28:33,891 INFO L422 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:28:34,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 07:28:34,099 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:28:34,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:28:34,099 INFO L82 PathProgramCache]: Analyzing trace with hash 948834309, now seen corresponding path program 12 times [2020-11-28 07:28:34,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:28:34,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996544190] [2020-11-28 07:28:34,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:28:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:28:34,884 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:28:34,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996544190] [2020-11-28 07:28:34,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101261670] [2020-11-28 07:28:34,884 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0de0d7c7-431f-427a-b773-43b8eeafd32a/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 07:28:34,960 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-28 07:28:34,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 07:28:34,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 43 conjunts are in the unsatisfiable core [2020-11-28 07:28:34,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 07:28:35,001 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:28:35,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-28 07:28:35,002 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:28:35,002 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,110 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,158 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,197 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,198 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,200 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,203 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,208 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,210 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,212 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,215 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,220 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,223 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,225 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,227 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,229 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,232 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,236 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,244 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,247 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,250 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,253 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,260 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,262 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,263 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,265 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,267 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,272 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,280 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,286 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,287 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,288 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,290 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,293 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,295 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,297 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,301 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,303 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:28:35,303 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:35,344 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:28:35,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1419768112] [2020-11-28 07:28:35,347 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-28 07:28:35,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-28 07:28:35,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 46 [2020-11-28 07:28:35,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384508319] [2020-11-28 07:28:35,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 48 states [2020-11-28 07:28:35,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:28:35,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2020-11-28 07:28:35,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=1696, Unknown=0, NotChecked=0, Total=2256 [2020-11-28 07:28:35,358 INFO L87 Difference]: Start difference. First operand 106 states and 262 transitions. Second operand 48 states. [2020-11-28 07:28:36,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:28:36,709 INFO L93 Difference]: Finished difference Result 178 states and 409 transitions. [2020-11-28 07:28:36,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2020-11-28 07:28:36,709 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2020-11-28 07:28:36,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:28:36,711 INFO L225 Difference]: With dead ends: 178 [2020-11-28 07:28:36,711 INFO L226 Difference]: Without dead ends: 160 [2020-11-28 07:28:36,713 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2544, Invalid=5646, Unknown=0, NotChecked=0, Total=8190 [2020-11-28 07:28:36,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-11-28 07:28:36,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 120. [2020-11-28 07:28:36,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-11-28 07:28:36,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 293 transitions. [2020-11-28 07:28:36,718 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 293 transitions. Word has length 47 [2020-11-28 07:28:36,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:28:36,718 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 293 transitions. [2020-11-28 07:28:36,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2020-11-28 07:28:36,718 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 293 transitions. [2020-11-28 07:28:36,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-28 07:28:36,719 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:28:36,720 INFO L422 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:28:36,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-11-28 07:28:36,950 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:28:36,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:28:36,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1830374497, now seen corresponding path program 13 times [2020-11-28 07:28:36,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:28:36,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246413339] [2020-11-28 07:28:36,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:28:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:28:37,697 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:28:37,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246413339] [2020-11-28 07:28:37,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904356806] [2020-11-28 07:28:37,698 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0de0d7c7-431f-427a-b773-43b8eeafd32a/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 07:28:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:28:37,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 43 conjunts are in the unsatisfiable core [2020-11-28 07:28:37,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 07:28:37,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:28:37,868 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:28:37,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-28 07:28:37,869 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:28:37,869 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:37,911 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:28:37,911 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:37,948 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:28:38,088 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:28:38,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1879674184] [2020-11-28 07:28:38,089 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-28 07:28:38,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-28 07:28:38,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 48 [2020-11-28 07:28:38,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479086393] [2020-11-28 07:28:38,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 50 states [2020-11-28 07:28:38,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:28:38,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2020-11-28 07:28:38,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=1896, Unknown=0, NotChecked=0, Total=2450 [2020-11-28 07:28:38,092 INFO L87 Difference]: Start difference. First operand 120 states and 293 transitions. Second operand 50 states. [2020-11-28 07:28:41,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:28:41,629 INFO L93 Difference]: Finished difference Result 280 states and 671 transitions. [2020-11-28 07:28:41,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2020-11-28 07:28:41,629 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 47 [2020-11-28 07:28:41,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:28:41,631 INFO L225 Difference]: With dead ends: 280 [2020-11-28 07:28:41,631 INFO L226 Difference]: Without dead ends: 245 [2020-11-28 07:28:41,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5608 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5722, Invalid=12910, Unknown=0, NotChecked=0, Total=18632 [2020-11-28 07:28:41,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2020-11-28 07:28:41,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 121. [2020-11-28 07:28:41,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-11-28 07:28:41,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 297 transitions. [2020-11-28 07:28:41,639 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 297 transitions. Word has length 47 [2020-11-28 07:28:41,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:28:41,639 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 297 transitions. [2020-11-28 07:28:41,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2020-11-28 07:28:41,639 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 297 transitions. [2020-11-28 07:28:41,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-28 07:28:41,640 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:28:41,640 INFO L422 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:28:41,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-11-28 07:28:41,841 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:28:41,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:28:41,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1666611019, now seen corresponding path program 14 times [2020-11-28 07:28:41,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:28:41,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284950097] [2020-11-28 07:28:41,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:28:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:28:42,195 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 342 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:28:42,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284950097] [2020-11-28 07:28:42,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953733412] [2020-11-28 07:28:42,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0de0d7c7-431f-427a-b773-43b8eeafd32a/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 07:28:42,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2020-11-28 07:28:42,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 07:28:42,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 22 conjunts are in the unsatisfiable core [2020-11-28 07:28:42,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 07:28:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:28:42,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-28 07:28:42,411 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:28:42,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-11-28 07:28:42,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23, 23] imperfect sequences [23] total 25 [2020-11-28 07:28:42,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995857036] [2020-11-28 07:28:42,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-28 07:28:42,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:28:42,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-28 07:28:42,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=340, Unknown=0, NotChecked=0, Total=600 [2020-11-28 07:28:42,415 INFO L87 Difference]: Start difference. First operand 121 states and 297 transitions. Second operand 23 states. [2020-11-28 07:28:42,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:28:42,486 INFO L93 Difference]: Finished difference Result 1019 states and 2433 transitions. [2020-11-28 07:28:42,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-28 07:28:42,486 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 49 [2020-11-28 07:28:42,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:28:42,487 INFO L225 Difference]: With dead ends: 1019 [2020-11-28 07:28:42,487 INFO L226 Difference]: Without dead ends: 0 [2020-11-28 07:28:42,487 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=260, Invalid=340, Unknown=0, NotChecked=0, Total=600 [2020-11-28 07:28:42,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-28 07:28:42,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-28 07:28:42,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-28 07:28:42,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-28 07:28:42,488 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2020-11-28 07:28:42,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:28:42,489 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 07:28:42,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-28 07:28:42,489 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-28 07:28:42,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-28 07:28:42,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-11-28 07:28:42,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 07:28:42 BasicIcfg [2020-11-28 07:28:42,709 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 07:28:42,710 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 07:28:42,710 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 07:28:42,710 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 07:28:42,710 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:28:14" (3/4) ... [2020-11-28 07:28:42,713 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-28 07:28:42,720 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure t1 [2020-11-28 07:28:42,720 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure t2 [2020-11-28 07:28:42,723 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2020-11-28 07:28:42,724 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-11-28 07:28:42,724 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-11-28 07:28:42,724 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-28 07:28:42,753 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0de0d7c7-431f-427a-b773-43b8eeafd32a/bin/utaipan/witness.graphml [2020-11-28 07:28:42,753 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 07:28:42,755 INFO L168 Benchmark]: Toolchain (without parser) took 29864.95 ms. Allocated memory was 109.1 MB in the beginning and 427.8 MB in the end (delta: 318.8 MB). Free memory was 80.6 MB in the beginning and 158.4 MB in the end (delta: -77.8 MB). Peak memory consumption was 239.9 MB. Max. memory is 16.1 GB. [2020-11-28 07:28:42,756 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 109.1 MB. Free memory is still 67.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 07:28:42,756 INFO L168 Benchmark]: CACSL2BoogieTranslator took 615.79 ms. Allocated memory is still 109.1 MB. Free memory was 80.3 MB in the beginning and 67.2 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-28 07:28:42,756 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.74 ms. Allocated memory is still 109.1 MB. Free memory was 67.2 MB in the beginning and 65.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 07:28:42,757 INFO L168 Benchmark]: Boogie Preprocessor took 27.22 ms. Allocated memory is still 109.1 MB. Free memory was 65.4 MB in the beginning and 64.1 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 07:28:42,759 INFO L168 Benchmark]: RCFGBuilder took 593.46 ms. Allocated memory was 109.1 MB in the beginning and 138.4 MB in the end (delta: 29.4 MB). Free memory was 63.9 MB in the beginning and 107.3 MB in the end (delta: -43.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 16.1 GB. [2020-11-28 07:28:42,759 INFO L168 Benchmark]: TraceAbstraction took 28536.95 ms. Allocated memory was 138.4 MB in the beginning and 427.8 MB in the end (delta: 289.4 MB). Free memory was 106.7 MB in the beginning and 160.5 MB in the end (delta: -53.8 MB). Peak memory consumption was 237.3 MB. Max. memory is 16.1 GB. [2020-11-28 07:28:42,759 INFO L168 Benchmark]: Witness Printer took 44.08 ms. Allocated memory is still 427.8 MB. Free memory was 160.5 MB in the beginning and 158.4 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 07:28:42,762 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 109.1 MB. Free memory is still 67.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 615.79 ms. Allocated memory is still 109.1 MB. Free memory was 80.3 MB in the beginning and 67.2 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.74 ms. Allocated memory is still 109.1 MB. Free memory was 67.2 MB in the beginning and 65.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 27.22 ms. Allocated memory is still 109.1 MB. Free memory was 65.4 MB in the beginning and 64.1 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 593.46 ms. Allocated memory was 109.1 MB in the beginning and 138.4 MB in the end (delta: 29.4 MB). Free memory was 63.9 MB in the beginning and 107.3 MB in the end (delta: -43.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 28536.95 ms. Allocated memory was 138.4 MB in the beginning and 427.8 MB in the end (delta: 289.4 MB). Free memory was 106.7 MB in the beginning and 160.5 MB in the end (delta: -53.8 MB). Peak memory consumption was 237.3 MB. Max. memory is 16.1 GB. * Witness Printer took 44.08 ms. Allocated memory is still 427.8 MB. Free memory was 160.5 MB in the beginning and 158.4 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 751 VarBasedMoverChecksPositive, 13 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 13 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 10 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.4s, 65 PlacesBefore, 20 PlacesAfterwards, 64 TransitionsBefore, 16 TransitionsAfterwards, 1144 CoEnabledTransitionPairs, 5 FixpointIterations, 16 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 60 TotalNumberOfCompositions, 1062 MoverChecksTotal - PositiveResult [Line: 693]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 28.4s, OverallIterations: 16, TraceHistogramMax: 21, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 344 SDtfs, 3026 SDslu, 1592 SDs, 0 SdLazy, 1731 SolverSat, 2223 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1196 GetRequests, 435 SyntacticMatches, 9 SemanticMatches, 752 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21001 ImplicationChecksByTransitivity, 16.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 649 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 636 NumberOfCodeBlocks, 636 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 891 ConstructedInterpolants, 0 QuantifiedInterpolants, 124969 SizeOfPredicates, 165 NumberOfNonLiveVariables, 1835 ConjunctsInSsa, 224 ConjunctsInUnsatCore, 36 InterpolantComputations, 8 PerfectInterpolantSequences, 1157/4620 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...