./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/triangular-longest-2.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_e8b88c0b-6f2d-4d6d-b897-6b2d6656f218/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_e8b88c0b-6f2d-4d6d-b897-6b2d6656f218/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e8b88c0b-6f2d-4d6d-b897-6b2d6656f218/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e8b88c0b-6f2d-4d6d-b897-6b2d6656f218/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/triangular-longest-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e8b88c0b-6f2d-4d6d-b897-6b2d6656f218/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e8b88c0b-6f2d-4d6d-b897-6b2d6656f218/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 faf61a04ec090f6b1743a12583eb9c9759e6ed3e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 01:36:17,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:36:17,251 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:36:17,322 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:36:17,323 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:36:17,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:36:17,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:36:17,360 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:36:17,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:36:17,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:36:17,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:36:17,366 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:36:17,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:36:17,385 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:36:17,386 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:36:17,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:36:17,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:36:17,398 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:36:17,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:36:17,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:36:17,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:36:17,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:36:17,417 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:36:17,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:36:17,422 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:36:17,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:36:17,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:36:17,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:36:17,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:36:17,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:36:17,427 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:36:17,428 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:36:17,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:36:17,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:36:17,432 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:36:17,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:36:17,433 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:36:17,434 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:36:17,434 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:36:17,436 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:36:17,437 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:36:17,440 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e8b88c0b-6f2d-4d6d-b897-6b2d6656f218/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-30 01:36:17,485 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:36:17,485 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:36:17,487 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 01:36:17,487 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 01:36:17,487 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 01:36:17,488 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 01:36:17,488 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-30 01:36:17,488 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 01:36:17,488 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 01:36:17,489 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-30 01:36:17,490 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-30 01:36:17,490 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 01:36:17,490 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-30 01:36:17,491 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-30 01:36:17,491 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-30 01:36:17,492 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:36:17,492 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:36:17,492 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:36:17,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:36:17,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:36:17,493 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 01:36:17,493 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:36:17,493 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 01:36:17,494 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 01:36:17,494 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:36:17,494 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:36:17,494 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:36:17,495 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 01:36:17,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:36:17,495 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:36:17,495 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:36:17,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:36:17,496 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:36:17,497 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:36:17,497 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 01:36:17,497 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-30 01:36:17,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 01:36:17,497 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 01:36:17,498 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:36:17,498 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 01:36:17,498 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_e8b88c0b-6f2d-4d6d-b897-6b2d6656f218/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_e8b88c0b-6f2d-4d6d-b897-6b2d6656f218/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 -> faf61a04ec090f6b1743a12583eb9c9759e6ed3e [2020-11-30 01:36:17,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:36:17,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:36:17,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:36:17,950 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:36:17,950 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:36:17,952 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e8b88c0b-6f2d-4d6d-b897-6b2d6656f218/bin/utaipan/../../sv-benchmarks/c/pthread/triangular-longest-2.i [2020-11-30 01:36:18,061 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e8b88c0b-6f2d-4d6d-b897-6b2d6656f218/bin/utaipan/data/0941e2b07/b5473220a04b465493be4b035c957925/FLAGceb658348 [2020-11-30 01:36:18,831 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:36:18,832 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e8b88c0b-6f2d-4d6d-b897-6b2d6656f218/sv-benchmarks/c/pthread/triangular-longest-2.i [2020-11-30 01:36:18,865 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e8b88c0b-6f2d-4d6d-b897-6b2d6656f218/bin/utaipan/data/0941e2b07/b5473220a04b465493be4b035c957925/FLAGceb658348 [2020-11-30 01:36:19,094 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e8b88c0b-6f2d-4d6d-b897-6b2d6656f218/bin/utaipan/data/0941e2b07/b5473220a04b465493be4b035c957925 [2020-11-30 01:36:19,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:36:19,102 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:36:19,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:36:19,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:36:19,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:36:19,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:36:19" (1/1) ... [2020-11-30 01:36:19,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d7bf864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:36:19, skipping insertion in model container [2020-11-30 01:36:19,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:36:19" (1/1) ... [2020-11-30 01:36:19,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:36:19,206 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:36:19,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:36:19,815 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:36:19,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:36:20,002 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:36:20,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:36:20 WrapperNode [2020-11-30 01:36:20,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:36:20,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:36:20,005 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:36:20,005 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:36:20,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:36:20" (1/1) ... [2020-11-30 01:36:20,059 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:36:20" (1/1) ... [2020-11-30 01:36:20,088 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:36:20,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:36:20,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:36:20,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:36:20,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:36:20" (1/1) ... [2020-11-30 01:36:20,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:36:20" (1/1) ... [2020-11-30 01:36:20,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:36:20" (1/1) ... [2020-11-30 01:36:20,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:36:20" (1/1) ... [2020-11-30 01:36:20,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:36:20" (1/1) ... [2020-11-30 01:36:20,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:36:20" (1/1) ... [2020-11-30 01:36:20,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:36:20" (1/1) ... [2020-11-30 01:36:20,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:36:20,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:36:20,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:36:20,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:36:20,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:36:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8b88c0b-6f2d-4d6d-b897-6b2d6656f218/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-30 01:36:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-11-30 01:36:20,248 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-11-30 01:36:20,248 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-11-30 01:36:20,248 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-11-30 01:36:20,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 01:36:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-30 01:36:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:36:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 01:36:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 01:36:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-30 01:36:20,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:36:20,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:36:20,252 WARN L208 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-30 01:36:20,870 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:36:20,870 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-11-30 01:36:20,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:36:20 BoogieIcfgContainer [2020-11-30 01:36:20,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:36:20,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:36:20,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:36:20,880 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:36:20,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:36:19" (1/3) ... [2020-11-30 01:36:20,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@620f7145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:36:20, skipping insertion in model container [2020-11-30 01:36:20,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:36:20" (2/3) ... [2020-11-30 01:36:20,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@620f7145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:36:20, skipping insertion in model container [2020-11-30 01:36:20,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:36:20" (3/3) ... [2020-11-30 01:36:20,883 INFO L111 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2020-11-30 01:36:20,897 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-30 01:36:20,898 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:36:20,904 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 01:36:20,905 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-30 01:36:20,937 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,938 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,938 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,938 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,939 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,939 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,939 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,940 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,940 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,940 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,941 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,941 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,941 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,941 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,942 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,942 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,943 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,943 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,943 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,943 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,944 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,944 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,944 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,945 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,945 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,945 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,945 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,946 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,948 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,949 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,949 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,949 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,949 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,950 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,961 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,961 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,962 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,962 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,962 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,962 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:36:20,965 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-30 01:36:20,980 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-11-30 01:36:21,001 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:36:21,001 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 01:36:21,001 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:36:21,001 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:36:21,002 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:36:21,002 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:36:21,002 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:36:21,002 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:36:21,015 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-30 01:36:21,018 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 64 transitions, 138 flow [2020-11-30 01:36:21,022 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 64 transitions, 138 flow [2020-11-30 01:36:21,024 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 65 places, 64 transitions, 138 flow [2020-11-30 01:36:21,070 INFO L129 PetriNetUnfolder]: 6/62 cut-off events. [2020-11-30 01:36:21,070 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-30 01:36:21,075 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-30 01:36:21,079 INFO L116 LiptonReduction]: Number of co-enabled transitions 1144 [2020-11-30 01:36:23,590 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2020-11-30 01:36:24,142 WARN L193 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2020-11-30 01:36:24,343 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-11-30 01:36:24,385 INFO L131 LiptonReduction]: Checked pairs total: 1062 [2020-11-30 01:36:24,385 INFO L133 LiptonReduction]: Total number of compositions: 60 [2020-11-30 01:36:24,391 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 16 transitions, 42 flow [2020-11-30 01:36:24,405 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2020-11-30 01:36:24,407 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-11-30 01:36:24,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-30 01:36:24,413 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:36:24,414 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-11-30 01:36:24,415 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:36:24,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:36:24,421 INFO L82 PathProgramCache]: Analyzing trace with hash -720017533, now seen corresponding path program 1 times [2020-11-30 01:36:24,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:36:24,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63692583] [2020-11-30 01:36:24,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:36:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:36:24,780 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-30 01:36:24,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63692583] [2020-11-30 01:36:24,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:36:24,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:36:24,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735363657] [2020-11-30 01:36:24,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:36:24,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:36:24,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:36:24,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:36:24,820 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2020-11-30 01:36:24,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:36:24,930 INFO L93 Difference]: Finished difference Result 75 states and 190 transitions. [2020-11-30 01:36:24,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:36:24,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-11-30 01:36:24,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:36:24,945 INFO L225 Difference]: With dead ends: 75 [2020-11-30 01:36:24,946 INFO L226 Difference]: Without dead ends: 42 [2020-11-30 01:36:24,947 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-30 01:36:24,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-30 01:36:24,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-30 01:36:24,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-30 01:36:24,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 98 transitions. [2020-11-30 01:36:24,992 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 98 transitions. Word has length 6 [2020-11-30 01:36:24,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:36:24,993 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 98 transitions. [2020-11-30 01:36:24,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:36:24,993 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 98 transitions. [2020-11-30 01:36:24,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-30 01:36:24,994 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:36:24,994 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:36:24,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 01:36:24,995 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:36:24,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:36:24,996 INFO L82 PathProgramCache]: Analyzing trace with hash -447013893, now seen corresponding path program 1 times [2020-11-30 01:36:24,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:36:24,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343833466] [2020-11-30 01:36:24,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:36:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:36:25,176 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-30 01:36:25,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343833466] [2020-11-30 01:36:25,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:36:25,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:36:25,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254690365] [2020-11-30 01:36:25,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:36:25,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:36:25,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:36:25,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:36:25,180 INFO L87 Difference]: Start difference. First operand 42 states and 98 transitions. Second operand 5 states. [2020-11-30 01:36:25,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:36:25,237 INFO L93 Difference]: Finished difference Result 56 states and 130 transitions. [2020-11-30 01:36:25,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:36:25,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-11-30 01:36:25,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:36:25,240 INFO L225 Difference]: With dead ends: 56 [2020-11-30 01:36:25,240 INFO L226 Difference]: Without dead ends: 50 [2020-11-30 01:36:25,241 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-30 01:36:25,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-11-30 01:36:25,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2020-11-30 01:36:25,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-30 01:36:25,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 100 transitions. [2020-11-30 01:36:25,249 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 100 transitions. Word has length 8 [2020-11-30 01:36:25,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:36:25,250 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 100 transitions. [2020-11-30 01:36:25,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:36:25,251 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 100 transitions. [2020-11-30 01:36:25,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 01:36:25,252 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:36:25,252 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:36:25,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 01:36:25,252 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:36:25,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:36:25,253 INFO L82 PathProgramCache]: Analyzing trace with hash -190894617, now seen corresponding path program 1 times [2020-11-30 01:36:25,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:36:25,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419125466] [2020-11-30 01:36:25,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:36:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:36:25,385 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-30 01:36:25,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419125466] [2020-11-30 01:36:25,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:36:25,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:36:25,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685425875] [2020-11-30 01:36:25,387 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:36:25,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:36:25,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:36:25,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:36:25,388 INFO L87 Difference]: Start difference. First operand 42 states and 100 transitions. Second operand 6 states. [2020-11-30 01:36:25,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:36:25,527 INFO L93 Difference]: Finished difference Result 54 states and 124 transitions. [2020-11-30 01:36:25,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:36:25,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-30 01:36:25,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:36:25,529 INFO L225 Difference]: With dead ends: 54 [2020-11-30 01:36:25,529 INFO L226 Difference]: Without dead ends: 47 [2020-11-30 01:36:25,530 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:36:25,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-30 01:36:25,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2020-11-30 01:36:25,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-11-30 01:36:25,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 106 transitions. [2020-11-30 01:36:25,540 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 106 transitions. Word has length 10 [2020-11-30 01:36:25,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:36:25,541 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 106 transitions. [2020-11-30 01:36:25,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:36:25,541 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 106 transitions. [2020-11-30 01:36:25,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 01:36:25,542 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:36:25,542 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:36:25,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 01:36:25,543 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:36:25,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:36:25,543 INFO L82 PathProgramCache]: Analyzing trace with hash -83647017, now seen corresponding path program 2 times [2020-11-30 01:36:25,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:36:25,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438364329] [2020-11-30 01:36:25,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:36:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:36:25,691 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-30 01:36:25,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438364329] [2020-11-30 01:36:25,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:36:25,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:36:25,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756002441] [2020-11-30 01:36:25,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:36:25,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:36:25,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:36:25,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:36:25,694 INFO L87 Difference]: Start difference. First operand 45 states and 106 transitions. Second operand 6 states. [2020-11-30 01:36:25,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:36:25,839 INFO L93 Difference]: Finished difference Result 84 states and 192 transitions. [2020-11-30 01:36:25,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 01:36:25,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-30 01:36:25,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:36:25,843 INFO L225 Difference]: With dead ends: 84 [2020-11-30 01:36:25,843 INFO L226 Difference]: Without dead ends: 77 [2020-11-30 01:36:25,843 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:36:25,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-30 01:36:25,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 47. [2020-11-30 01:36:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-30 01:36:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 115 transitions. [2020-11-30 01:36:25,854 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 115 transitions. Word has length 10 [2020-11-30 01:36:25,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:36:25,854 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 115 transitions. [2020-11-30 01:36:25,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:36:25,854 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 115 transitions. [2020-11-30 01:36:25,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 01:36:25,855 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:36:25,856 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:36:25,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 01:36:25,856 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:36:25,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:36:25,857 INFO L82 PathProgramCache]: Analyzing trace with hash -83970657, now seen corresponding path program 3 times [2020-11-30 01:36:25,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:36:25,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889207465] [2020-11-30 01:36:25,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:36:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:36:25,984 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-30 01:36:25,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889207465] [2020-11-30 01:36:25,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:36:25,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:36:25,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675129254] [2020-11-30 01:36:25,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:36:25,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:36:25,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:36:25,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:36:25,988 INFO L87 Difference]: Start difference. First operand 47 states and 115 transitions. Second operand 6 states. [2020-11-30 01:36:26,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:36:26,099 INFO L93 Difference]: Finished difference Result 61 states and 139 transitions. [2020-11-30 01:36:26,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:36:26,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-30 01:36:26,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:36:26,102 INFO L225 Difference]: With dead ends: 61 [2020-11-30 01:36:26,102 INFO L226 Difference]: Without dead ends: 50 [2020-11-30 01:36:26,103 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-30 01:36:26,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-11-30 01:36:26,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2020-11-30 01:36:26,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-30 01:36:26,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 96 transitions. [2020-11-30 01:36:26,111 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 96 transitions. Word has length 10 [2020-11-30 01:36:26,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:36:26,111 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 96 transitions. [2020-11-30 01:36:26,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:36:26,117 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 96 transitions. [2020-11-30 01:36:26,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 01:36:26,119 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:36:26,119 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:36:26,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 01:36:26,120 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:36:26,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:36:26,120 INFO L82 PathProgramCache]: Analyzing trace with hash -118912617, now seen corresponding path program 4 times [2020-11-30 01:36:26,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:36:26,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066260741] [2020-11-30 01:36:26,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:36:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:36:26,246 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-30 01:36:26,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066260741] [2020-11-30 01:36:26,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:36:26,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:36:26,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742761287] [2020-11-30 01:36:26,248 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:36:26,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:36:26,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:36:26,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:36:26,249 INFO L87 Difference]: Start difference. First operand 40 states and 96 transitions. Second operand 6 states. [2020-11-30 01:36:26,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:36:26,356 INFO L93 Difference]: Finished difference Result 55 states and 129 transitions. [2020-11-30 01:36:26,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:36:26,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-30 01:36:26,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:36:26,362 INFO L225 Difference]: With dead ends: 55 [2020-11-30 01:36:26,362 INFO L226 Difference]: Without dead ends: 49 [2020-11-30 01:36:26,363 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-30 01:36:26,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-11-30 01:36:26,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2020-11-30 01:36:26,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-11-30 01:36:26,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 99 transitions. [2020-11-30 01:36:26,379 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 99 transitions. Word has length 10 [2020-11-30 01:36:26,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:36:26,382 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 99 transitions. [2020-11-30 01:36:26,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:36:26,383 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 99 transitions. [2020-11-30 01:36:26,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-30 01:36:26,384 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:36:26,384 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:36:26,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 01:36:26,384 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:36:26,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:36:26,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1691902418, now seen corresponding path program 5 times [2020-11-30 01:36:26,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:36:26,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725632806] [2020-11-30 01:36:26,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:36:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:36:26,484 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-30 01:36:26,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725632806] [2020-11-30 01:36:26,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353606911] [2020-11-30 01:36:26,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8b88c0b-6f2d-4d6d-b897-6b2d6656f218/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-30 01:36:26,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-11-30 01:36:26,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:36:26,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 01:36:26,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:36:26,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:36:26,832 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-30 01:36:26,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:36:26,838 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:36:26,838 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:26,877 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:36:26,878 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:26,928 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:26,991 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-30 01:36:26,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [493781924] [2020-11-30 01:36:27,002 FATAL L? ?]: Ignoring exception! java.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-30 01:36:27,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 01:36:27,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2020-11-30 01:36:27,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655802642] [2020-11-30 01:36:27,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-30 01:36:27,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:36:27,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-30 01:36:27,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-11-30 01:36:27,006 INFO L87 Difference]: Start difference. First operand 41 states and 99 transitions. Second operand 13 states. [2020-11-30 01:36:27,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:36:27,468 INFO L93 Difference]: Finished difference Result 82 states and 197 transitions. [2020-11-30 01:36:27,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 01:36:27,469 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2020-11-30 01:36:27,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:36:27,470 INFO L225 Difference]: With dead ends: 82 [2020-11-30 01:36:27,470 INFO L226 Difference]: Without dead ends: 56 [2020-11-30 01:36:27,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2020-11-30 01:36:27,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-11-30 01:36:27,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2020-11-30 01:36:27,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-30 01:36:27,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 97 transitions. [2020-11-30 01:36:27,485 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 97 transitions. Word has length 11 [2020-11-30 01:36:27,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:36:27,485 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 97 transitions. [2020-11-30 01:36:27,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-30 01:36:27,485 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 97 transitions. [2020-11-30 01:36:27,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 01:36:27,486 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:36:27,487 INFO L422 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:36:27,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-11-30 01:36:27,708 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:36:27,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:36:27,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1230025166, now seen corresponding path program 6 times [2020-11-30 01:36:27,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:36:27,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131107915] [2020-11-30 01:36:27,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:36:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:36:27,829 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-30 01:36:27,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131107915] [2020-11-30 01:36:27,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120497381] [2020-11-30 01:36:27,829 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8b88c0b-6f2d-4d6d-b897-6b2d6656f218/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-30 01:36:27,894 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 01:36:27,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:36:27,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 01:36:27,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:36:27,945 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-30 01:36:27,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:36:27,947 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:36:27,947 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:28,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:28,076 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:28,107 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:28,137 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:28,161 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:28,193 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:36:28,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:28,233 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-30 01:36:28,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1469941775] [2020-11-30 01:36:28,236 FATAL L? ?]: Ignoring exception! java.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-30 01:36:28,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 01:36:28,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2020-11-30 01:36:28,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964978877] [2020-11-30 01:36:28,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-30 01:36:28,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:36:28,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-30 01:36:28,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-11-30 01:36:28,253 INFO L87 Difference]: Start difference. First operand 40 states and 97 transitions. Second operand 16 states. [2020-11-30 01:36:28,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:36:28,552 INFO L93 Difference]: Finished difference Result 91 states and 202 transitions. [2020-11-30 01:36:28,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-30 01:36:28,553 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2020-11-30 01:36:28,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:36:28,554 INFO L225 Difference]: With dead ends: 91 [2020-11-30 01:36:28,554 INFO L226 Difference]: Without dead ends: 66 [2020-11-30 01:36:28,555 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-30 01:36:28,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-11-30 01:36:28,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2020-11-30 01:36:28,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-11-30 01:36:28,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 136 transitions. [2020-11-30 01:36:28,569 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 136 transitions. Word has length 14 [2020-11-30 01:36:28,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:36:28,569 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 136 transitions. [2020-11-30 01:36:28,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-30 01:36:28,570 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 136 transitions. [2020-11-30 01:36:28,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 01:36:28,573 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:36:28,574 INFO L422 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:36:28,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:36:28,780 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:36:28,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:36:28,781 INFO L82 PathProgramCache]: Analyzing trace with hash 415819444, now seen corresponding path program 7 times [2020-11-30 01:36:28,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:36:28,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127110374] [2020-11-30 01:36:28,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:36:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:36:28,902 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-30 01:36:28,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127110374] [2020-11-30 01:36:28,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131416449] [2020-11-30 01:36:28,902 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8b88c0b-6f2d-4d6d-b897-6b2d6656f218/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-30 01:36:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:36:28,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 01:36:28,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:36:29,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:36:29,058 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-30 01:36:29,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:36:29,060 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:36:29,061 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:29,089 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:36:29,089 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:29,124 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:29,233 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-30 01:36:29,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1871538160] [2020-11-30 01:36:29,235 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java: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-30 01:36:29,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 01:36:29,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2020-11-30 01:36:29,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892832562] [2020-11-30 01:36:29,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-30 01:36:29,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:36:29,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-30 01:36:29,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2020-11-30 01:36:29,238 INFO L87 Difference]: Start difference. First operand 58 states and 136 transitions. Second operand 17 states. [2020-11-30 01:36:30,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:36:30,001 INFO L93 Difference]: Finished difference Result 157 states and 377 transitions. [2020-11-30 01:36:30,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-30 01:36:30,002 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2020-11-30 01:36:30,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:36:30,003 INFO L225 Difference]: With dead ends: 157 [2020-11-30 01:36:30,004 INFO L226 Difference]: Without dead ends: 108 [2020-11-30 01:36:30,005 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=478, Invalid=1004, Unknown=0, NotChecked=0, Total=1482 [2020-11-30 01:36:30,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-11-30 01:36:30,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 65. [2020-11-30 01:36:30,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-30 01:36:30,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 161 transitions. [2020-11-30 01:36:30,023 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 161 transitions. Word has length 14 [2020-11-30 01:36:30,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:36:30,024 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 161 transitions. [2020-11-30 01:36:30,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-30 01:36:30,024 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 161 transitions. [2020-11-30 01:36:30,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-30 01:36:30,025 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:36:30,025 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:36:30,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:36:30,226 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:36:30,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:36:30,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1483738395, now seen corresponding path program 8 times [2020-11-30 01:36:30,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:36:30,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408482692] [2020-11-30 01:36:30,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:36:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:36:30,410 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-30 01:36:30,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408482692] [2020-11-30 01:36:30,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347693421] [2020-11-30 01:36:30,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8b88c0b-6f2d-4d6d-b897-6b2d6656f218/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-30 01:36:30,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-11-30 01:36:30,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:36:30,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-30 01:36:30,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:36:30,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:36:30,572 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-30 01:36:30,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:36:30,574 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:36:30,574 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:30,606 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:36:30,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:30,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:30,882 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-30 01:36:30,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1987675427] [2020-11-30 01:36:30,883 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java: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-30 01:36:30,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 01:36:30,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2020-11-30 01:36:30,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540814056] [2020-11-30 01:36:30,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-30 01:36:30,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:36:30,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-30 01:36:30,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2020-11-30 01:36:30,886 INFO L87 Difference]: Start difference. First operand 65 states and 161 transitions. Second operand 25 states. [2020-11-30 01:36:32,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:36:32,238 INFO L93 Difference]: Finished difference Result 210 states and 515 transitions. [2020-11-30 01:36:32,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-11-30 01:36:32,239 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 17 [2020-11-30 01:36:32,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:36:32,241 INFO L225 Difference]: With dead ends: 210 [2020-11-30 01:36:32,241 INFO L226 Difference]: Without dead ends: 129 [2020-11-30 01:36:32,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1117, Invalid=2423, Unknown=0, NotChecked=0, Total=3540 [2020-11-30 01:36:32,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-11-30 01:36:32,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 64. [2020-11-30 01:36:32,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-30 01:36:32,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 157 transitions. [2020-11-30 01:36:32,264 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 157 transitions. Word has length 17 [2020-11-30 01:36:32,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:36:32,264 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 157 transitions. [2020-11-30 01:36:32,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-30 01:36:32,265 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 157 transitions. [2020-11-30 01:36:32,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-30 01:36:32,268 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:36:32,268 INFO L422 BasicCegarLoop]: trace histogram [10, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:36:32,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:36:32,469 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:36:32,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:36:32,470 INFO L82 PathProgramCache]: Analyzing trace with hash -154578414, now seen corresponding path program 9 times [2020-11-30 01:36:32,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:36:32,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682087885] [2020-11-30 01:36:32,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:36:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:36:32,857 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-30 01:36:32,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682087885] [2020-11-30 01:36:32,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338875450] [2020-11-30 01:36:32,858 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8b88c0b-6f2d-4d6d-b897-6b2d6656f218/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-30 01:36:32,931 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 01:36:32,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:36:32,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2020-11-30 01:36:32,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:36:32,985 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-30 01:36:32,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:36:32,987 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:36:32,988 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:33,023 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:33,061 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:33,114 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:33,140 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:33,166 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:33,207 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:33,232 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:33,261 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:33,291 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:33,320 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:33,353 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:33,381 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:33,458 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:33,546 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:33,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:33,625 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:33,660 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:33,709 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:36:33,709 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:33,750 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-30 01:36:33,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [185629105] [2020-11-30 01:36:33,751 FATAL L? ?]: Ignoring exception! java.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-30 01:36:33,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 01:36:33,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2020-11-30 01:36:33,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547152586] [2020-11-30 01:36:33,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 40 states [2020-11-30 01:36:33,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:36:33,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2020-11-30 01:36:33,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1165, Unknown=0, NotChecked=0, Total=1560 [2020-11-30 01:36:33,757 INFO L87 Difference]: Start difference. First operand 64 states and 157 transitions. Second operand 40 states. [2020-11-30 01:36:35,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:36:35,071 INFO L93 Difference]: Finished difference Result 181 states and 394 transitions. [2020-11-30 01:36:35,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-11-30 01:36:35,071 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 26 [2020-11-30 01:36:35,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:36:35,072 INFO L225 Difference]: With dead ends: 181 [2020-11-30 01:36:35,073 INFO L226 Difference]: Without dead ends: 120 [2020-11-30 01:36:35,074 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1165 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1745, Invalid=3805, Unknown=0, NotChecked=0, Total=5550 [2020-11-30 01:36:35,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-11-30 01:36:35,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 100. [2020-11-30 01:36:35,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-11-30 01:36:35,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 232 transitions. [2020-11-30 01:36:35,083 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 232 transitions. Word has length 26 [2020-11-30 01:36:35,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:36:35,083 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 232 transitions. [2020-11-30 01:36:35,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2020-11-30 01:36:35,084 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 232 transitions. [2020-11-30 01:36:35,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-30 01:36:35,085 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:36:35,085 INFO L422 BasicCegarLoop]: trace histogram [10, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:36:35,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-11-30 01:36:35,300 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:36:35,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:36:35,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1558563116, now seen corresponding path program 10 times [2020-11-30 01:36:35,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:36:35,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859272922] [2020-11-30 01:36:35,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:36:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:36:35,577 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-30 01:36:35,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859272922] [2020-11-30 01:36:35,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842689913] [2020-11-30 01:36:35,578 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8b88c0b-6f2d-4d6d-b897-6b2d6656f218/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-30 01:36:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:36:35,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2020-11-30 01:36:35,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:36:35,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:36:35,738 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-30 01:36:35,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:36:35,740 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:36:35,740 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:35,783 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:36:35,783 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:35,810 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:36,343 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-30 01:36:36,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1544124305] [2020-11-30 01:36:36,344 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java: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-30 01:36:36,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 01:36:36,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 39 [2020-11-30 01:36:36,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937110104] [2020-11-30 01:36:36,346 INFO L461 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-11-30 01:36:36,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:36:36,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-11-30 01:36:36,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=1240, Unknown=0, NotChecked=0, Total=1640 [2020-11-30 01:36:36,348 INFO L87 Difference]: Start difference. First operand 100 states and 232 transitions. Second operand 41 states. [2020-11-30 01:36:39,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:36:39,388 INFO L93 Difference]: Finished difference Result 352 states and 851 transitions. [2020-11-30 01:36:39,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2020-11-30 01:36:39,391 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 26 [2020-11-30 01:36:39,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:36:39,394 INFO L225 Difference]: With dead ends: 352 [2020-11-30 01:36:39,394 INFO L226 Difference]: Without dead ends: 229 [2020-11-30 01:36:39,399 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4112 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3796, Invalid=8414, Unknown=0, NotChecked=0, Total=12210 [2020-11-30 01:36:39,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-11-30 01:36:39,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 104. [2020-11-30 01:36:39,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-11-30 01:36:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 254 transitions. [2020-11-30 01:36:39,423 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 254 transitions. Word has length 26 [2020-11-30 01:36:39,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:36:39,424 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 254 transitions. [2020-11-30 01:36:39,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-11-30 01:36:39,424 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 254 transitions. [2020-11-30 01:36:39,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-30 01:36:39,426 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:36:39,426 INFO L422 BasicCegarLoop]: trace histogram [17, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:36:39,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:36:39,640 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:36:39,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:36:39,641 INFO L82 PathProgramCache]: Analyzing trace with hash 349348741, now seen corresponding path program 11 times [2020-11-30 01:36:39,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:36:39,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052142857] [2020-11-30 01:36:39,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:36:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:36:40,276 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-30 01:36:40,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052142857] [2020-11-30 01:36:40,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415613023] [2020-11-30 01:36:40,277 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8b88c0b-6f2d-4d6d-b897-6b2d6656f218/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-30 01:36:40,404 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2020-11-30 01:36:40,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:36:40,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 35 conjunts are in the unsatisfiable core [2020-11-30 01:36:40,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:36:40,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:36:40,495 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-30 01:36:40,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:36:40,496 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:36:40,496 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:40,527 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:36:40,527 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:40,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:41,030 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-30 01:36:41,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1610557636] [2020-11-30 01:36:41,031 FATAL L? ?]: Ignoring exception! java.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-30 01:36:41,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 01:36:41,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 44 [2020-11-30 01:36:41,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270342995] [2020-11-30 01:36:41,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 46 states [2020-11-30 01:36:41,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:36:41,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2020-11-30 01:36:41,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=1593, Unknown=0, NotChecked=0, Total=2070 [2020-11-30 01:36:41,037 INFO L87 Difference]: Start difference. First operand 104 states and 254 transitions. Second operand 46 states. [2020-11-30 01:36:44,546 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2020-11-30 01:36:44,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:36:44,651 INFO L93 Difference]: Finished difference Result 316 states and 779 transitions. [2020-11-30 01:36:44,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2020-11-30 01:36:44,652 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 40 [2020-11-30 01:36:44,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:36:44,655 INFO L225 Difference]: With dead ends: 316 [2020-11-30 01:36:44,655 INFO L226 Difference]: Without dead ends: 256 [2020-11-30 01:36:44,663 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4528 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4660, Invalid=10346, Unknown=0, NotChecked=0, Total=15006 [2020-11-30 01:36:44,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-11-30 01:36:44,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 106. [2020-11-30 01:36:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-11-30 01:36:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 262 transitions. [2020-11-30 01:36:44,675 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 262 transitions. Word has length 40 [2020-11-30 01:36:44,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:36:44,675 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 262 transitions. [2020-11-30 01:36:44,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2020-11-30 01:36:44,676 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 262 transitions. [2020-11-30 01:36:44,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-30 01:36:44,677 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:36:44,678 INFO L422 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:36:44,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:36:44,884 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:36:44,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:36:44,885 INFO L82 PathProgramCache]: Analyzing trace with hash 948834309, now seen corresponding path program 12 times [2020-11-30 01:36:44,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:36:44,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892661355] [2020-11-30 01:36:44,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:36:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:36:45,960 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-30 01:36:45,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892661355] [2020-11-30 01:36:45,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10049649] [2020-11-30 01:36:45,961 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8b88c0b-6f2d-4d6d-b897-6b2d6656f218/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-30 01:36:46,078 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 01:36:46,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:36:46,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 43 conjunts are in the unsatisfiable core [2020-11-30 01:36:46,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:36:46,163 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-30 01:36:46,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:36:46,165 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:36:46,165 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:46,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:46,259 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:46,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:46,342 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:46,432 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:46,486 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:46,541 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:46,592 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:46,636 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:46,685 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:46,733 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:46,781 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:46,823 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:46,859 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:46,895 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:46,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:46,975 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:47,021 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:47,060 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:47,093 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:47,143 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:47,191 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:47,231 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:47,269 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:47,301 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:47,334 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:47,372 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:47,404 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:47,434 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:47,463 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:47,491 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:47,528 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:47,554 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:47,621 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:47,653 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:47,679 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:47,731 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:47,769 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:47,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:47,833 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:36:47,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:47,892 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-30 01:36:47,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [891459692] [2020-11-30 01:36:47,896 FATAL L? ?]: Ignoring exception! java.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-30 01:36:47,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 01:36:47,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 82 [2020-11-30 01:36:47,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715656122] [2020-11-30 01:36:47,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 84 states [2020-11-30 01:36:47,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:36:47,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2020-11-30 01:36:47,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1730, Invalid=5242, Unknown=0, NotChecked=0, Total=6972 [2020-11-30 01:36:47,911 INFO L87 Difference]: Start difference. First operand 106 states and 262 transitions. Second operand 84 states. [2020-11-30 01:36:49,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:36:49,701 INFO L93 Difference]: Finished difference Result 170 states and 393 transitions. [2020-11-30 01:36:49,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-11-30 01:36:49,702 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 47 [2020-11-30 01:36:49,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:36:49,704 INFO L225 Difference]: With dead ends: 170 [2020-11-30 01:36:49,704 INFO L226 Difference]: Without dead ends: 158 [2020-11-30 01:36:49,708 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4989 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4355, Invalid=11145, Unknown=0, NotChecked=0, Total=15500 [2020-11-30 01:36:49,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-11-30 01:36:49,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 118. [2020-11-30 01:36:49,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-11-30 01:36:49,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 289 transitions. [2020-11-30 01:36:49,715 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 289 transitions. Word has length 47 [2020-11-30 01:36:49,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:36:49,715 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 289 transitions. [2020-11-30 01:36:49,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2020-11-30 01:36:49,715 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 289 transitions. [2020-11-30 01:36:49,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-30 01:36:49,717 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:36:49,717 INFO L422 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:36:49,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-11-30 01:36:49,944 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:36:49,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:36:49,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1830374497, now seen corresponding path program 13 times [2020-11-30 01:36:49,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:36:49,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359276667] [2020-11-30 01:36:49,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:36:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:36:50,785 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-30 01:36:50,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359276667] [2020-11-30 01:36:50,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067584418] [2020-11-30 01:36:50,786 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8b88c0b-6f2d-4d6d-b897-6b2d6656f218/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-30 01:36:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:36:50,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 43 conjunts are in the unsatisfiable core [2020-11-30 01:36:50,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:36:51,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:36:51,031 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-30 01:36:51,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:36:51,032 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:36:51,032 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:51,081 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:36:51,081 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:51,118 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:36:52,282 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-30 01:36:52,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [446780536] [2020-11-30 01:36:52,283 FATAL L? ?]: Ignoring exception! java.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-30 01:36:52,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 01:36:52,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 83 [2020-11-30 01:36:52,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095137080] [2020-11-30 01:36:52,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 85 states [2020-11-30 01:36:52,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:36:52,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2020-11-30 01:36:52,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1663, Invalid=5477, Unknown=0, NotChecked=0, Total=7140 [2020-11-30 01:36:52,289 INFO L87 Difference]: Start difference. First operand 118 states and 289 transitions. Second operand 85 states. [2020-11-30 01:36:56,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:36:56,596 INFO L93 Difference]: Finished difference Result 229 states and 561 transitions. [2020-11-30 01:36:56,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2020-11-30 01:36:56,600 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 47 [2020-11-30 01:36:56,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:36:56,602 INFO L225 Difference]: With dead ends: 229 [2020-11-30 01:36:56,602 INFO L226 Difference]: Without dead ends: 205 [2020-11-30 01:36:56,610 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9295 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8063, Invalid=20329, Unknown=0, NotChecked=0, Total=28392 [2020-11-30 01:36:56,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-11-30 01:36:56,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 157. [2020-11-30 01:36:56,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-11-30 01:36:56,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 407 transitions. [2020-11-30 01:36:56,624 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 407 transitions. Word has length 47 [2020-11-30 01:36:56,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:36:56,625 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 407 transitions. [2020-11-30 01:36:56,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2020-11-30 01:36:56,625 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 407 transitions. [2020-11-30 01:36:56,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-30 01:36:56,626 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:36:56,626 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:36:56,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-11-30 01:36:56,826 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:36:56,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:36:56,827 INFO L82 PathProgramCache]: Analyzing trace with hash 99219872, now seen corresponding path program 14 times [2020-11-30 01:36:56,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:36:56,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396595003] [2020-11-30 01:36:56,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:36:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:36:56,870 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:36:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:36:56,911 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:36:56,963 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-30 01:36:56,964 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 01:36:56,964 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-30 01:36:57,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 01:36:57 BasicIcfg [2020-11-30 01:36:57,124 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 01:36:57,128 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:36:57,128 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:36:57,128 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:36:57,129 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:36:20" (3/4) ... [2020-11-30 01:36:57,131 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 01:36:57,251 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e8b88c0b-6f2d-4d6d-b897-6b2d6656f218/bin/utaipan/witness.graphml [2020-11-30 01:36:57,251 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:36:57,258 INFO L168 Benchmark]: Toolchain (without parser) took 38155.40 ms. Allocated memory was 94.4 MB in the beginning and 375.4 MB in the end (delta: 281.0 MB). Free memory was 62.6 MB in the beginning and 240.0 MB in the end (delta: -177.4 MB). Peak memory consumption was 103.8 MB. Max. memory is 16.1 GB. [2020-11-30 01:36:57,258 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 75.5 MB. Free memory was 37.6 MB in the beginning and 37.6 MB in the end (delta: 63.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:36:57,259 INFO L168 Benchmark]: CACSL2BoogieTranslator took 896.58 ms. Allocated memory is still 94.4 MB. Free memory was 62.4 MB in the beginning and 52.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-30 01:36:57,260 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.40 ms. Allocated memory is still 94.4 MB. Free memory was 52.3 MB in the beginning and 50.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:36:57,264 INFO L168 Benchmark]: Boogie Preprocessor took 67.58 ms. Allocated memory is still 94.4 MB. Free memory was 50.6 MB in the beginning and 49.5 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:36:57,264 INFO L168 Benchmark]: RCFGBuilder took 715.03 ms. Allocated memory is still 94.4 MB. Free memory was 49.0 MB in the beginning and 71.4 MB in the end (delta: -22.4 MB). Peak memory consumption was 22.9 MB. Max. memory is 16.1 GB. [2020-11-30 01:36:57,265 INFO L168 Benchmark]: TraceAbstraction took 36249.17 ms. Allocated memory was 94.4 MB in the beginning and 375.4 MB in the end (delta: 281.0 MB). Free memory was 70.8 MB in the beginning and 253.6 MB in the end (delta: -182.8 MB). Peak memory consumption was 98.0 MB. Max. memory is 16.1 GB. [2020-11-30 01:36:57,265 INFO L168 Benchmark]: Witness Printer took 124.32 ms. Allocated memory is still 375.4 MB. Free memory was 253.6 MB in the beginning and 240.0 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-30 01:36:57,268 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.29 ms. Allocated memory is still 75.5 MB. Free memory was 37.6 MB in the beginning and 37.6 MB in the end (delta: 63.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 896.58 ms. Allocated memory is still 94.4 MB. Free memory was 62.4 MB in the beginning and 52.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 83.40 ms. Allocated memory is still 94.4 MB. Free memory was 52.3 MB in the beginning and 50.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 67.58 ms. Allocated memory is still 94.4 MB. Free memory was 50.6 MB in the beginning and 49.5 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 715.03 ms. Allocated memory is still 94.4 MB. Free memory was 49.0 MB in the beginning and 71.4 MB in the end (delta: -22.4 MB). Peak memory consumption was 22.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 36249.17 ms. Allocated memory was 94.4 MB in the beginning and 375.4 MB in the end (delta: 281.0 MB). Free memory was 70.8 MB in the beginning and 253.6 MB in the end (delta: -182.8 MB). Peak memory consumption was 98.0 MB. Max. memory is 16.1 GB. * Witness Printer took 124.32 ms. Allocated memory is still 375.4 MB. Free memory was 253.6 MB in the beginning and 240.0 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. 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: 3.3s, 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 - CounterExampleResult [Line: 693]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arg={0:0}, i=3, j=6] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arg={0:0}, arg={0:0}, i=3, j=6] [L716] 0 int condI = i >= (2*20 +6); VAL [arg={0:0}, arg={0:0}, i=3, j=6] [L696] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=1] [L704] 2 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=3, k=2] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=5, k=4] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=6, k=5] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=7, k=6] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=8, k=7] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=10] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=11, k=10] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=12, k=11] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=14, k=13] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=17, k=16] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=20] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=20, k=20] [L719] 0 int condJ = j >= (2*20 +6); [L721] COND TRUE 0 condI || condJ [L693] COND FALSE 0 !(0) [L693] 0 __assert_fail ("0", "triangular-longest-2.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=20, k=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 35.9s, OverallIterations: 16, TraceHistogramMax: 20, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 224 SDtfs, 2625 SDslu, 1289 SDs, 0 SdLazy, 1637 SolverSat, 2144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1070 GetRequests, 290 SyntacticMatches, 10 SemanticMatches, 770 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25810 ImplicationChecksByTransitivity, 22.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred 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.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 573 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 586 NumberOfCodeBlocks, 586 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 747 ConstructedInterpolants, 0 QuantifiedInterpolants, 105961 SizeOfPredicates, 165 NumberOfNonLiveVariables, 1552 ConjunctsInSsa, 201 ConjunctsInUnsatCore, 33 InterpolantComputations, 6 PerfectInterpolantSequences, 15/3420 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 incorrect! Received shutdown request...