./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/triangular-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_ec0deb12-3939-4092-92a8-105a61b44172/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_ec0deb12-3939-4092-92a8-105a61b44172/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ec0deb12-3939-4092-92a8-105a61b44172/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ec0deb12-3939-4092-92a8-105a61b44172/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/triangular-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ec0deb12-3939-4092-92a8-105a61b44172/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ec0deb12-3939-4092-92a8-105a61b44172/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 39211c46f4aae13996ba33c19e2c7157964c8aaa ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 02:45:51,393 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 02:45:51,395 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 02:45:51,455 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 02:45:51,464 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 02:45:51,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 02:45:51,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 02:45:51,479 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 02:45:51,482 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 02:45:51,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 02:45:51,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 02:45:51,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 02:45:51,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 02:45:51,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 02:45:51,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 02:45:51,497 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 02:45:51,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 02:45:51,500 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 02:45:51,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 02:45:51,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 02:45:51,514 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 02:45:51,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 02:45:51,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 02:45:51,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 02:45:51,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 02:45:51,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 02:45:51,527 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 02:45:51,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 02:45:51,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 02:45:51,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 02:45:51,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 02:45:51,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 02:45:51,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 02:45:51,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 02:45:51,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 02:45:51,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 02:45:51,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 02:45:51,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 02:45:51,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 02:45:51,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 02:45:51,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 02:45:51,541 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ec0deb12-3939-4092-92a8-105a61b44172/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-30 02:45:51,568 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 02:45:51,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 02:45:51,569 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 02:45:51,569 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 02:45:51,569 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 02:45:51,569 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 02:45:51,569 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-30 02:45:51,570 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 02:45:51,570 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 02:45:51,570 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-30 02:45:51,570 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-30 02:45:51,570 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 02:45:51,571 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-30 02:45:51,571 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-30 02:45:51,571 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-30 02:45:51,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 02:45:51,572 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 02:45:51,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 02:45:51,572 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 02:45:51,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 02:45:51,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 02:45:51,573 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 02:45:51,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 02:45:51,573 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 02:45:51,573 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 02:45:51,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 02:45:51,574 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 02:45:51,574 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 02:45:51,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 02:45:51,574 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 02:45:51,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 02:45:51,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 02:45:51,575 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 02:45:51,575 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 02:45:51,575 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 02:45:51,575 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-30 02:45:51,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 02:45:51,576 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 02:45:51,576 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 02:45:51,578 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 02:45:51,578 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_ec0deb12-3939-4092-92a8-105a61b44172/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_ec0deb12-3939-4092-92a8-105a61b44172/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 -> 39211c46f4aae13996ba33c19e2c7157964c8aaa [2020-11-30 02:45:51,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 02:45:51,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 02:45:51,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 02:45:51,856 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 02:45:51,862 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 02:45:51,863 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ec0deb12-3939-4092-92a8-105a61b44172/bin/utaipan/../../sv-benchmarks/c/pthread/triangular-2.i [2020-11-30 02:45:51,923 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ec0deb12-3939-4092-92a8-105a61b44172/bin/utaipan/data/32fce051c/2da8b52fbc52418d88b200c5f5bb489c/FLAG398b91b24 [2020-11-30 02:45:52,491 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 02:45:52,493 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ec0deb12-3939-4092-92a8-105a61b44172/sv-benchmarks/c/pthread/triangular-2.i [2020-11-30 02:45:52,515 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ec0deb12-3939-4092-92a8-105a61b44172/bin/utaipan/data/32fce051c/2da8b52fbc52418d88b200c5f5bb489c/FLAG398b91b24 [2020-11-30 02:45:52,766 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ec0deb12-3939-4092-92a8-105a61b44172/bin/utaipan/data/32fce051c/2da8b52fbc52418d88b200c5f5bb489c [2020-11-30 02:45:52,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 02:45:52,769 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 02:45:52,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 02:45:52,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 02:45:52,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 02:45:52,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:45:52" (1/1) ... [2020-11-30 02:45:52,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f7056dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:45:52, skipping insertion in model container [2020-11-30 02:45:52,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:45:52" (1/1) ... [2020-11-30 02:45:52,784 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 02:45:52,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 02:45:53,169 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:45:53,177 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 02:45:53,216 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:45:53,286 INFO L208 MainTranslator]: Completed translation [2020-11-30 02:45:53,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:45:53 WrapperNode [2020-11-30 02:45:53,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 02:45:53,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 02:45:53,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 02:45:53,289 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 02:45:53,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:45:53" (1/1) ... [2020-11-30 02:45:53,311 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:45:53" (1/1) ... [2020-11-30 02:45:53,328 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 02:45:53,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 02:45:53,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 02:45:53,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 02:45:53,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:45:53" (1/1) ... [2020-11-30 02:45:53,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:45:53" (1/1) ... [2020-11-30 02:45:53,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:45:53" (1/1) ... [2020-11-30 02:45:53,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:45:53" (1/1) ... [2020-11-30 02:45:53,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:45:53" (1/1) ... [2020-11-30 02:45:53,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:45:53" (1/1) ... [2020-11-30 02:45:53,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:45:53" (1/1) ... [2020-11-30 02:45:53,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 02:45:53,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 02:45:53,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 02:45:53,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 02:45:53,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:45:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ec0deb12-3939-4092-92a8-105a61b44172/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 02:45:53,430 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-11-30 02:45:53,430 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-11-30 02:45:53,431 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-11-30 02:45:53,431 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-11-30 02:45:53,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 02:45:53,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-30 02:45:53,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 02:45:53,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 02:45:53,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 02:45:53,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-30 02:45:53,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 02:45:53,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 02:45:53,434 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 02:45:53,797 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 02:45:53,799 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-11-30 02:45:53,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:45:53 BoogieIcfgContainer [2020-11-30 02:45:53,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 02:45:53,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 02:45:53,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 02:45:53,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 02:45:53,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 02:45:52" (1/3) ... [2020-11-30 02:45:53,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e72f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:45:53, skipping insertion in model container [2020-11-30 02:45:53,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:45:53" (2/3) ... [2020-11-30 02:45:53,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e72f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:45:53, skipping insertion in model container [2020-11-30 02:45:53,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:45:53" (3/3) ... [2020-11-30 02:45:53,815 INFO L111 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2020-11-30 02:45:53,828 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-30 02:45:53,828 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 02:45:53,831 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 02:45:53,832 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-30 02:45:53,853 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,854 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,854 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,854 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,854 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,855 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,855 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,855 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,855 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,856 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,856 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,856 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,856 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,856 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,857 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,857 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,857 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,857 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,858 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,858 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,858 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,858 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,858 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,859 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,859 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,859 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,859 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,860 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,861 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,862 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,862 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,862 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,863 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,863 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,866 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,867 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,867 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,867 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,867 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,867 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:45:53,869 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-30 02:45:53,880 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-11-30 02:45:53,903 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 02:45:53,903 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 02:45:53,903 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 02:45:53,903 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 02:45:53,904 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 02:45:53,904 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 02:45:53,904 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 02:45:53,904 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 02:45:53,922 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-30 02:45:53,924 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 64 transitions, 138 flow [2020-11-30 02:45:53,928 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 64 transitions, 138 flow [2020-11-30 02:45:53,929 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 65 places, 64 transitions, 138 flow [2020-11-30 02:45:53,990 INFO L129 PetriNetUnfolder]: 6/62 cut-off events. [2020-11-30 02:45:53,991 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-30 02:45:53,997 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 02:45:54,001 INFO L116 LiptonReduction]: Number of co-enabled transitions 1144 [2020-11-30 02:45:55,476 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2020-11-30 02:45:55,882 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2020-11-30 02:45:56,049 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-11-30 02:45:56,061 INFO L131 LiptonReduction]: Checked pairs total: 1062 [2020-11-30 02:45:56,061 INFO L133 LiptonReduction]: Total number of compositions: 60 [2020-11-30 02:45:56,069 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 16 transitions, 42 flow [2020-11-30 02:45:56,079 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2020-11-30 02:45:56,081 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-11-30 02:45:56,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-30 02:45:56,086 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:45:56,086 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-11-30 02:45:56,087 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:45:56,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:45:56,092 INFO L82 PathProgramCache]: Analyzing trace with hash -720017533, now seen corresponding path program 1 times [2020-11-30 02:45:56,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:45:56,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137749536] [2020-11-30 02:45:56,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:45:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:45:56,305 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 02:45:56,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137749536] [2020-11-30 02:45:56,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:45:56,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 02:45:56,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537419097] [2020-11-30 02:45:56,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:45:56,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:45:56,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:45:56,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:45:56,326 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2020-11-30 02:45:56,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:45:56,388 INFO L93 Difference]: Finished difference Result 75 states and 190 transitions. [2020-11-30 02:45:56,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:45:56,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-11-30 02:45:56,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:45:56,399 INFO L225 Difference]: With dead ends: 75 [2020-11-30 02:45:56,399 INFO L226 Difference]: Without dead ends: 42 [2020-11-30 02:45:56,401 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 02:45:56,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-30 02:45:56,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-30 02:45:56,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-30 02:45:56,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 98 transitions. [2020-11-30 02:45:56,435 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 98 transitions. Word has length 6 [2020-11-30 02:45:56,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:45:56,435 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 98 transitions. [2020-11-30 02:45:56,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:45:56,435 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 98 transitions. [2020-11-30 02:45:56,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-30 02:45:56,436 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:45:56,436 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:45:56,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 02:45:56,437 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:45:56,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:45:56,437 INFO L82 PathProgramCache]: Analyzing trace with hash -447013893, now seen corresponding path program 1 times [2020-11-30 02:45:56,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:45:56,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992049201] [2020-11-30 02:45:56,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:45:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:45:56,564 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 02:45:56,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992049201] [2020-11-30 02:45:56,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:45:56,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:45:56,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985984482] [2020-11-30 02:45:56,566 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 02:45:56,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:45:56,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 02:45:56,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:45:56,567 INFO L87 Difference]: Start difference. First operand 42 states and 98 transitions. Second operand 5 states. [2020-11-30 02:45:56,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:45:56,610 INFO L93 Difference]: Finished difference Result 56 states and 130 transitions. [2020-11-30 02:45:56,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:45:56,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-11-30 02:45:56,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:45:56,612 INFO L225 Difference]: With dead ends: 56 [2020-11-30 02:45:56,612 INFO L226 Difference]: Without dead ends: 50 [2020-11-30 02:45:56,613 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 02:45:56,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-11-30 02:45:56,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2020-11-30 02:45:56,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-30 02:45:56,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 100 transitions. [2020-11-30 02:45:56,620 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 100 transitions. Word has length 8 [2020-11-30 02:45:56,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:45:56,621 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 100 transitions. [2020-11-30 02:45:56,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 02:45:56,622 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 100 transitions. [2020-11-30 02:45:56,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 02:45:56,623 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:45:56,623 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:45:56,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 02:45:56,623 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:45:56,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:45:56,624 INFO L82 PathProgramCache]: Analyzing trace with hash -190894617, now seen corresponding path program 1 times [2020-11-30 02:45:56,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:45:56,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446109779] [2020-11-30 02:45:56,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:45:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:45:56,734 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 02:45:56,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446109779] [2020-11-30 02:45:56,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:45:56,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 02:45:56,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806912064] [2020-11-30 02:45:56,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:45:56,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:45:56,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:45:56,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:45:56,738 INFO L87 Difference]: Start difference. First operand 42 states and 100 transitions. Second operand 6 states. [2020-11-30 02:45:56,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:45:56,844 INFO L93 Difference]: Finished difference Result 54 states and 124 transitions. [2020-11-30 02:45:56,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 02:45:56,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-30 02:45:56,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:45:56,847 INFO L225 Difference]: With dead ends: 54 [2020-11-30 02:45:56,847 INFO L226 Difference]: Without dead ends: 47 [2020-11-30 02:45:56,847 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 02:45:56,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-30 02:45:56,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2020-11-30 02:45:56,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-11-30 02:45:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 106 transitions. [2020-11-30 02:45:56,858 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 106 transitions. Word has length 10 [2020-11-30 02:45:56,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:45:56,858 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 106 transitions. [2020-11-30 02:45:56,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:45:56,858 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 106 transitions. [2020-11-30 02:45:56,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 02:45:56,860 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:45:56,860 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:45:56,860 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 02:45:56,860 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:45:56,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:45:56,862 INFO L82 PathProgramCache]: Analyzing trace with hash -83647017, now seen corresponding path program 2 times [2020-11-30 02:45:56,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:45:56,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106738285] [2020-11-30 02:45:56,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:45:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:45:56,957 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 02:45:56,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106738285] [2020-11-30 02:45:56,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:45:56,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 02:45:56,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500827835] [2020-11-30 02:45:56,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:45:56,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:45:56,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:45:56,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:45:56,960 INFO L87 Difference]: Start difference. First operand 45 states and 106 transitions. Second operand 6 states. [2020-11-30 02:45:57,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:45:57,040 INFO L93 Difference]: Finished difference Result 84 states and 192 transitions. [2020-11-30 02:45:57,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 02:45:57,043 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-30 02:45:57,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:45:57,045 INFO L225 Difference]: With dead ends: 84 [2020-11-30 02:45:57,045 INFO L226 Difference]: Without dead ends: 77 [2020-11-30 02:45:57,045 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-30 02:45:57,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-30 02:45:57,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 47. [2020-11-30 02:45:57,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-30 02:45:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 115 transitions. [2020-11-30 02:45:57,061 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 115 transitions. Word has length 10 [2020-11-30 02:45:57,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:45:57,062 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 115 transitions. [2020-11-30 02:45:57,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:45:57,063 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 115 transitions. [2020-11-30 02:45:57,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 02:45:57,065 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:45:57,065 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:45:57,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 02:45:57,065 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:45:57,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:45:57,067 INFO L82 PathProgramCache]: Analyzing trace with hash -83970657, now seen corresponding path program 3 times [2020-11-30 02:45:57,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:45:57,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624747144] [2020-11-30 02:45:57,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:45:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:45:57,147 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 02:45:57,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624747144] [2020-11-30 02:45:57,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:45:57,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 02:45:57,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613123120] [2020-11-30 02:45:57,148 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:45:57,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:45:57,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:45:57,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:45:57,149 INFO L87 Difference]: Start difference. First operand 47 states and 115 transitions. Second operand 6 states. [2020-11-30 02:45:57,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:45:57,241 INFO L93 Difference]: Finished difference Result 61 states and 139 transitions. [2020-11-30 02:45:57,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 02:45:57,241 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-30 02:45:57,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:45:57,242 INFO L225 Difference]: With dead ends: 61 [2020-11-30 02:45:57,242 INFO L226 Difference]: Without dead ends: 50 [2020-11-30 02:45:57,243 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 02:45:57,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-11-30 02:45:57,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2020-11-30 02:45:57,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-30 02:45:57,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 96 transitions. [2020-11-30 02:45:57,253 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 96 transitions. Word has length 10 [2020-11-30 02:45:57,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:45:57,253 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 96 transitions. [2020-11-30 02:45:57,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:45:57,254 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 96 transitions. [2020-11-30 02:45:57,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 02:45:57,255 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:45:57,255 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:45:57,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 02:45:57,255 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:45:57,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:45:57,256 INFO L82 PathProgramCache]: Analyzing trace with hash -118912617, now seen corresponding path program 4 times [2020-11-30 02:45:57,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:45:57,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219859515] [2020-11-30 02:45:57,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:45:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:45:57,372 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 02:45:57,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219859515] [2020-11-30 02:45:57,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:45:57,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 02:45:57,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291958771] [2020-11-30 02:45:57,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:45:57,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:45:57,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:45:57,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:45:57,374 INFO L87 Difference]: Start difference. First operand 40 states and 96 transitions. Second operand 6 states. [2020-11-30 02:45:57,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:45:57,469 INFO L93 Difference]: Finished difference Result 55 states and 129 transitions. [2020-11-30 02:45:57,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 02:45:57,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-30 02:45:57,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:45:57,474 INFO L225 Difference]: With dead ends: 55 [2020-11-30 02:45:57,474 INFO L226 Difference]: Without dead ends: 49 [2020-11-30 02:45:57,475 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 02:45:57,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-11-30 02:45:57,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2020-11-30 02:45:57,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-11-30 02:45:57,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 99 transitions. [2020-11-30 02:45:57,480 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 99 transitions. Word has length 10 [2020-11-30 02:45:57,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:45:57,480 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 99 transitions. [2020-11-30 02:45:57,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:45:57,480 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 99 transitions. [2020-11-30 02:45:57,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-30 02:45:57,481 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:45:57,481 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:45:57,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 02:45:57,481 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:45:57,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:45:57,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1691902418, now seen corresponding path program 5 times [2020-11-30 02:45:57,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:45:57,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885442762] [2020-11-30 02:45:57,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:45:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:45:57,571 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 02:45:57,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885442762] [2020-11-30 02:45:57,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121985313] [2020-11-30 02:45:57,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ec0deb12-3939-4092-92a8-105a61b44172/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 02:45:57,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-11-30 02:45:57,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 02:45:57,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 02:45:57,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:45:57,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:45:57,751 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 02:45:57,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:45:57,755 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 02:45:57,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:45:57,893 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 02:45:57,894 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:45:57,920 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:45:57,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 02:45:57,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1690263104] [2020-11-30 02:45:57,997 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java: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 02:45:57,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:45:57,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2020-11-30 02:45:57,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244797122] [2020-11-30 02:45:58,000 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-30 02:45:58,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:45:58,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-30 02:45:58,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-11-30 02:45:58,001 INFO L87 Difference]: Start difference. First operand 41 states and 99 transitions. Second operand 13 states. [2020-11-30 02:45:58,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:45:58,346 INFO L93 Difference]: Finished difference Result 82 states and 197 transitions. [2020-11-30 02:45:58,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 02:45:58,347 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2020-11-30 02:45:58,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:45:58,348 INFO L225 Difference]: With dead ends: 82 [2020-11-30 02:45:58,348 INFO L226 Difference]: Without dead ends: 56 [2020-11-30 02:45:58,349 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2020-11-30 02:45:58,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-11-30 02:45:58,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2020-11-30 02:45:58,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-30 02:45:58,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 97 transitions. [2020-11-30 02:45:58,359 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 97 transitions. Word has length 11 [2020-11-30 02:45:58,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:45:58,360 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 97 transitions. [2020-11-30 02:45:58,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-30 02:45:58,360 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 97 transitions. [2020-11-30 02:45:58,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 02:45:58,361 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:45:58,361 INFO L422 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:45:58,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-11-30 02:45:58,562 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:45:58,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:45:58,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1230025166, now seen corresponding path program 6 times [2020-11-30 02:45:58,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:45:58,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907461895] [2020-11-30 02:45:58,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:45:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:45:58,687 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 02:45:58,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907461895] [2020-11-30 02:45:58,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647999808] [2020-11-30 02:45:58,688 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ec0deb12-3939-4092-92a8-105a61b44172/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 02:45:58,767 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 02:45:58,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 02:45:58,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 02:45:58,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:45:58,801 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 02:45:58,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:45:58,803 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 02:45:58,804 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:45:58,835 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:45:58,859 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:45:58,886 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:45:58,909 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:45:58,934 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:45:58,957 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 02:45:58,957 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:45:58,988 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 02:45:58,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1908067779] [2020-11-30 02:45:58,990 FATAL L? ?]: Ignoring exception! java.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 02:45:58,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:45:58,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2020-11-30 02:45:58,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085242511] [2020-11-30 02:45:58,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-30 02:45:58,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:45:58,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-30 02:45:58,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-11-30 02:45:58,996 INFO L87 Difference]: Start difference. First operand 40 states and 97 transitions. Second operand 16 states. [2020-11-30 02:45:59,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:45:59,325 INFO L93 Difference]: Finished difference Result 91 states and 202 transitions. [2020-11-30 02:45:59,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-30 02:45:59,325 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2020-11-30 02:45:59,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:45:59,326 INFO L225 Difference]: With dead ends: 91 [2020-11-30 02:45:59,326 INFO L226 Difference]: Without dead ends: 66 [2020-11-30 02:45:59,327 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 02:45:59,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-11-30 02:45:59,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2020-11-30 02:45:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-11-30 02:45:59,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 136 transitions. [2020-11-30 02:45:59,333 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 136 transitions. Word has length 14 [2020-11-30 02:45:59,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:45:59,333 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 136 transitions. [2020-11-30 02:45:59,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-30 02:45:59,333 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 136 transitions. [2020-11-30 02:45:59,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 02:45:59,334 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:45:59,334 INFO L422 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:45:59,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:45:59,535 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:45:59,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:45:59,535 INFO L82 PathProgramCache]: Analyzing trace with hash 415819444, now seen corresponding path program 7 times [2020-11-30 02:45:59,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:45:59,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937266760] [2020-11-30 02:45:59,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:45:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:45:59,621 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 02:45:59,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937266760] [2020-11-30 02:45:59,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85676639] [2020-11-30 02:45:59,622 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ec0deb12-3939-4092-92a8-105a61b44172/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 02:45:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:45:59,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 02:45:59,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:45:59,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 02:45:59,745 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 02:45:59,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:45:59,747 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 02:45:59,747 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:45:59,770 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 02:45:59,770 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:45:59,792 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:45:59,887 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 02:45:59,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [615165437] [2020-11-30 02:45:59,888 FATAL L? ?]: Ignoring exception! java.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 02:45:59,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:45:59,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2020-11-30 02:45:59,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501394090] [2020-11-30 02:45:59,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-30 02:45:59,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:45:59,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-30 02:45:59,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2020-11-30 02:45:59,890 INFO L87 Difference]: Start difference. First operand 58 states and 136 transitions. Second operand 17 states. [2020-11-30 02:46:00,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:46:00,637 INFO L93 Difference]: Finished difference Result 157 states and 377 transitions. [2020-11-30 02:46:00,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-30 02:46:00,637 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2020-11-30 02:46:00,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:46:00,638 INFO L225 Difference]: With dead ends: 157 [2020-11-30 02:46:00,638 INFO L226 Difference]: Without dead ends: 108 [2020-11-30 02:46:00,639 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 02:46:00,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-11-30 02:46:00,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 65. [2020-11-30 02:46:00,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-30 02:46:00,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 161 transitions. [2020-11-30 02:46:00,646 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 161 transitions. Word has length 14 [2020-11-30 02:46:00,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:46:00,646 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 161 transitions. [2020-11-30 02:46:00,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-30 02:46:00,646 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 161 transitions. [2020-11-30 02:46:00,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-30 02:46:00,647 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:46:00,647 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:46:00,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:46:00,857 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:46:00,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:46:00,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1483738395, now seen corresponding path program 8 times [2020-11-30 02:46:00,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:46:00,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306839108] [2020-11-30 02:46:00,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:46:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:46:01,051 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 02:46:01,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306839108] [2020-11-30 02:46:01,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019770028] [2020-11-30 02:46:01,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ec0deb12-3939-4092-92a8-105a61b44172/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 02:46:01,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-11-30 02:46:01,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 02:46:01,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-30 02:46:01,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:46:01,191 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 02:46:01,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:46:01,192 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 02:46:01,193 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:46:01,219 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 02:46:01,219 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:46:01,275 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 02:46:01,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [42304473] [2020-11-30 02:46:01,277 FATAL L? ?]: Ignoring exception! java.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 02:46:01,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:46:01,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 14 [2020-11-30 02:46:01,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077569342] [2020-11-30 02:46:01,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-30 02:46:01,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:46:01,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-30 02:46:01,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-11-30 02:46:01,281 INFO L87 Difference]: Start difference. First operand 65 states and 161 transitions. Second operand 16 states. [2020-11-30 02:46:01,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:46:01,810 INFO L93 Difference]: Finished difference Result 124 states and 303 transitions. [2020-11-30 02:46:01,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-30 02:46:01,810 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2020-11-30 02:46:01,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:46:01,811 INFO L225 Difference]: With dead ends: 124 [2020-11-30 02:46:01,811 INFO L226 Difference]: Without dead ends: 104 [2020-11-30 02:46:01,812 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=358, Invalid=832, Unknown=0, NotChecked=0, Total=1190 [2020-11-30 02:46:01,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-11-30 02:46:01,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 66. [2020-11-30 02:46:01,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-30 02:46:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 164 transitions. [2020-11-30 02:46:01,825 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 164 transitions. Word has length 17 [2020-11-30 02:46:01,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:46:01,825 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 164 transitions. [2020-11-30 02:46:01,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-30 02:46:01,825 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 164 transitions. [2020-11-30 02:46:01,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 02:46:01,826 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:46:01,826 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:46:02,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:46:02,036 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:46:02,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:46:02,037 INFO L82 PathProgramCache]: Analyzing trace with hash 832673395, now seen corresponding path program 9 times [2020-11-30 02:46:02,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:46:02,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013406997] [2020-11-30 02:46:02,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:46:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 02:46:02,057 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 02:46:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 02:46:02,071 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 02:46:02,092 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-30 02:46:02,093 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 02:46:02,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 02:46:02,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 02:46:02 BasicIcfg [2020-11-30 02:46:02,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 02:46:02,141 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 02:46:02,142 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 02:46:02,142 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 02:46:02,142 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:45:53" (3/4) ... [2020-11-30 02:46:02,144 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 02:46:02,203 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ec0deb12-3939-4092-92a8-105a61b44172/bin/utaipan/witness.graphml [2020-11-30 02:46:02,204 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 02:46:02,205 INFO L168 Benchmark]: Toolchain (without parser) took 9434.74 ms. Allocated memory was 121.6 MB in the beginning and 176.2 MB in the end (delta: 54.5 MB). Free memory was 92.0 MB in the beginning and 68.6 MB in the end (delta: 23.4 MB). Peak memory consumption was 77.3 MB. Max. memory is 16.1 GB. [2020-11-30 02:46:02,205 INFO L168 Benchmark]: CDTParser took 0.81 ms. Allocated memory is still 81.8 MB. Free memory was 42.0 MB in the beginning and 41.9 MB in the end (delta: 36.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 02:46:02,205 INFO L168 Benchmark]: CACSL2BoogieTranslator took 516.43 ms. Allocated memory is still 121.6 MB. Free memory was 92.0 MB in the beginning and 80.5 MB in the end (delta: 11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 02:46:02,206 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.22 ms. Allocated memory is still 121.6 MB. Free memory was 80.5 MB in the beginning and 78.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 02:46:02,206 INFO L168 Benchmark]: Boogie Preprocessor took 26.09 ms. Allocated memory is still 121.6 MB. Free memory was 78.4 MB in the beginning and 77.2 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 02:46:02,207 INFO L168 Benchmark]: RCFGBuilder took 445.92 ms. Allocated memory is still 121.6 MB. Free memory was 77.2 MB in the beginning and 95.0 MB in the end (delta: -17.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 16.1 GB. [2020-11-30 02:46:02,207 INFO L168 Benchmark]: TraceAbstraction took 8335.07 ms. Allocated memory was 121.6 MB in the beginning and 176.2 MB in the end (delta: 54.5 MB). Free memory was 94.4 MB in the beginning and 73.8 MB in the end (delta: 20.6 MB). Peak memory consumption was 76.0 MB. Max. memory is 16.1 GB. [2020-11-30 02:46:02,208 INFO L168 Benchmark]: Witness Printer took 62.22 ms. Allocated memory is still 176.2 MB. Free memory was 73.8 MB in the beginning and 68.6 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 02:46:02,210 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.81 ms. Allocated memory is still 81.8 MB. Free memory was 42.0 MB in the beginning and 41.9 MB in the end (delta: 36.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 516.43 ms. Allocated memory is still 121.6 MB. Free memory was 92.0 MB in the beginning and 80.5 MB in the end (delta: 11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.22 ms. Allocated memory is still 121.6 MB. Free memory was 80.5 MB in the beginning and 78.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 26.09 ms. Allocated memory is still 121.6 MB. Free memory was 78.4 MB in the beginning and 77.2 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 445.92 ms. Allocated memory is still 121.6 MB. Free memory was 77.2 MB in the beginning and 95.0 MB in the end (delta: -17.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 8335.07 ms. Allocated memory was 121.6 MB in the beginning and 176.2 MB in the end (delta: 54.5 MB). Free memory was 94.4 MB in the beginning and 73.8 MB in the end (delta: 20.6 MB). Peak memory consumption was 76.0 MB. Max. memory is 16.1 GB. * Witness Printer took 62.22 ms. Allocated memory is still 176.2 MB. Free memory was 73.8 MB in the beginning and 68.6 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 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: 2.1s, 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*5 +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 < 5 [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 < 5 [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 < 5 [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 < 5 [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 < 5 [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 < 5 [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 < 5 [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=4, k=3] [L704] COND TRUE 2 k < 5 [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 < 5 [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 < 5 [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] [L719] 0 int condJ = j >= (2*5 +6); [L721] COND TRUE 0 condI || condJ [L693] COND FALSE 0 !(0) [L693] 0 __assert_fail ("0", "triangular-2.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.1s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, HoareTripleCheckerStatistics: 147 SDtfs, 493 SDslu, 474 SDs, 0 SdLazy, 487 SolverSat, 234 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 232 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 163 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 10590 SizeOfPredicates, 22 NumberOfNonLiveVariables, 432 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 6/93 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...