./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/triangular-longest-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f38c4c33-1368-4d6c-ad2e-036bae421b4b/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_f38c4c33-1368-4d6c-ad2e-036bae421b4b/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f38c4c33-1368-4d6c-ad2e-036bae421b4b/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f38c4c33-1368-4d6c-ad2e-036bae421b4b/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/triangular-longest-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f38c4c33-1368-4d6c-ad2e-036bae421b4b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f38c4c33-1368-4d6c-ad2e-036bae421b4b/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 37b183961076d6fcb23260763ff12b2e8c94306b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 03:35:24,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 03:35:24,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 03:35:24,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 03:35:24,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 03:35:24,065 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 03:35:24,068 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 03:35:24,075 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 03:35:24,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 03:35:24,084 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 03:35:24,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 03:35:24,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 03:35:24,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 03:35:24,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 03:35:24,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 03:35:24,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 03:35:24,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 03:35:24,099 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 03:35:24,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 03:35:24,103 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 03:35:24,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 03:35:24,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 03:35:24,108 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 03:35:24,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 03:35:24,112 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 03:35:24,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 03:35:24,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 03:35:24,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 03:35:24,115 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 03:35:24,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 03:35:24,117 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 03:35:24,118 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 03:35:24,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 03:35:24,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 03:35:24,121 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 03:35:24,121 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 03:35:24,122 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 03:35:24,122 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 03:35:24,123 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 03:35:24,124 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 03:35:24,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 03:35:24,126 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f38c4c33-1368-4d6c-ad2e-036bae421b4b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-30 03:35:24,150 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 03:35:24,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 03:35:24,151 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 03:35:24,151 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 03:35:24,151 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 03:35:24,152 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 03:35:24,152 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-30 03:35:24,152 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 03:35:24,152 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 03:35:24,153 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-30 03:35:24,153 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-30 03:35:24,153 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 03:35:24,153 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-30 03:35:24,154 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-30 03:35:24,154 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-30 03:35:24,155 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 03:35:24,155 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 03:35:24,155 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 03:35:24,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 03:35:24,156 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 03:35:24,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 03:35:24,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 03:35:24,156 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 03:35:24,157 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 03:35:24,157 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 03:35:24,157 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 03:35:24,157 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 03:35:24,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 03:35:24,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 03:35:24,158 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 03:35:24,158 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 03:35:24,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 03:35:24,160 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 03:35:24,160 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 03:35:24,160 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 03:35:24,160 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-30 03:35:24,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 03:35:24,162 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 03:35:24,162 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 03:35:24,162 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 03:35:24,162 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_f38c4c33-1368-4d6c-ad2e-036bae421b4b/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_f38c4c33-1368-4d6c-ad2e-036bae421b4b/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 37b183961076d6fcb23260763ff12b2e8c94306b [2020-11-30 03:35:24,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 03:35:24,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 03:35:24,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 03:35:24,460 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 03:35:24,461 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 03:35:24,462 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f38c4c33-1368-4d6c-ad2e-036bae421b4b/bin/utaipan/../../sv-benchmarks/c/pthread/triangular-longest-1.i [2020-11-30 03:35:24,548 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f38c4c33-1368-4d6c-ad2e-036bae421b4b/bin/utaipan/data/cbd2d224e/50c0cfd2fba0456b8d74e8c878c6e3a6/FLAG352e6707c [2020-11-30 03:35:25,080 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 03:35:25,080 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f38c4c33-1368-4d6c-ad2e-036bae421b4b/sv-benchmarks/c/pthread/triangular-longest-1.i [2020-11-30 03:35:25,095 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f38c4c33-1368-4d6c-ad2e-036bae421b4b/bin/utaipan/data/cbd2d224e/50c0cfd2fba0456b8d74e8c878c6e3a6/FLAG352e6707c [2020-11-30 03:35:25,371 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f38c4c33-1368-4d6c-ad2e-036bae421b4b/bin/utaipan/data/cbd2d224e/50c0cfd2fba0456b8d74e8c878c6e3a6 [2020-11-30 03:35:25,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 03:35:25,375 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 03:35:25,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 03:35:25,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 03:35:25,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 03:35:25,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:35:25" (1/1) ... [2020-11-30 03:35:25,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41e40df2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:35:25, skipping insertion in model container [2020-11-30 03:35:25,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:35:25" (1/1) ... [2020-11-30 03:35:25,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 03:35:25,433 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 03:35:25,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 03:35:25,779 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 03:35:25,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 03:35:25,942 INFO L208 MainTranslator]: Completed translation [2020-11-30 03:35:25,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:35:25 WrapperNode [2020-11-30 03:35:25,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 03:35:25,945 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 03:35:25,946 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 03:35:25,946 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 03:35:25,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:35:25" (1/1) ... [2020-11-30 03:35:25,988 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:35:25" (1/1) ... [2020-11-30 03:35:26,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 03:35:26,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 03:35:26,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 03:35:26,014 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 03:35:26,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:35:25" (1/1) ... [2020-11-30 03:35:26,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:35:25" (1/1) ... [2020-11-30 03:35:26,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:35:25" (1/1) ... [2020-11-30 03:35:26,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:35:25" (1/1) ... [2020-11-30 03:35:26,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:35:25" (1/1) ... [2020-11-30 03:35:26,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:35:25" (1/1) ... [2020-11-30 03:35:26,051 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:35:25" (1/1) ... [2020-11-30 03:35:26,054 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 03:35:26,055 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 03:35:26,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 03:35:26,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 03:35:26,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:35:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f38c4c33-1368-4d6c-ad2e-036bae421b4b/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 03:35:26,149 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-11-30 03:35:26,149 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-11-30 03:35:26,149 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-11-30 03:35:26,150 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-11-30 03:35:26,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 03:35:26,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-30 03:35:26,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 03:35:26,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 03:35:26,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 03:35:26,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-30 03:35:26,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 03:35:26,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 03:35:26,154 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 03:35:26,611 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 03:35:26,611 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-11-30 03:35:26,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:35:26 BoogieIcfgContainer [2020-11-30 03:35:26,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 03:35:26,615 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 03:35:26,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 03:35:26,618 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 03:35:26,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:35:25" (1/3) ... [2020-11-30 03:35:26,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f9bf849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:35:26, skipping insertion in model container [2020-11-30 03:35:26,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:35:25" (2/3) ... [2020-11-30 03:35:26,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f9bf849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:35:26, skipping insertion in model container [2020-11-30 03:35:26,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:35:26" (3/3) ... [2020-11-30 03:35:26,621 INFO L111 eAbstractionObserver]: Analyzing ICFG triangular-longest-1.i [2020-11-30 03:35:26,639 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-30 03:35:26,639 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 03:35:26,644 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 03:35:26,645 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-30 03:35:26,670 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,670 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,671 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,671 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,671 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,671 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,672 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,672 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,672 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,672 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,673 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,673 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,673 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,673 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,674 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,674 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,674 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,675 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,675 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,675 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,675 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,676 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,676 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,676 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,676 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,677 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,677 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,677 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,679 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,680 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,680 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,680 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,681 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,681 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,687 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,688 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,688 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,688 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,688 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,688 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 03:35:26,692 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-30 03:35:26,704 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-11-30 03:35:26,726 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 03:35:26,726 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 03:35:26,726 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 03:35:26,727 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 03:35:26,727 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 03:35:26,727 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 03:35:26,727 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 03:35:26,727 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 03:35:26,738 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-30 03:35:26,740 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 64 transitions, 138 flow [2020-11-30 03:35:26,743 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 64 transitions, 138 flow [2020-11-30 03:35:26,745 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 65 places, 64 transitions, 138 flow [2020-11-30 03:35:26,795 INFO L129 PetriNetUnfolder]: 6/62 cut-off events. [2020-11-30 03:35:26,795 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-30 03:35:26,799 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 03:35:26,801 INFO L116 LiptonReduction]: Number of co-enabled transitions 1144 [2020-11-30 03:35:28,485 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2020-11-30 03:35:28,884 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2020-11-30 03:35:29,055 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-11-30 03:35:29,071 INFO L131 LiptonReduction]: Checked pairs total: 1062 [2020-11-30 03:35:29,071 INFO L133 LiptonReduction]: Total number of compositions: 60 [2020-11-30 03:35:29,082 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 16 transitions, 42 flow [2020-11-30 03:35:29,089 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2020-11-30 03:35:29,090 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-11-30 03:35:29,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-30 03:35:29,095 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:35:29,095 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-11-30 03:35:29,095 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:35:29,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:35:29,101 INFO L82 PathProgramCache]: Analyzing trace with hash -720017533, now seen corresponding path program 1 times [2020-11-30 03:35:29,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:35:29,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613966379] [2020-11-30 03:35:29,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:35:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:35:29,301 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 03:35:29,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613966379] [2020-11-30 03:35:29,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:35:29,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 03:35:29,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085779793] [2020-11-30 03:35:29,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 03:35:29,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:35:29,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 03:35:29,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 03:35:29,332 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2020-11-30 03:35:29,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:35:29,404 INFO L93 Difference]: Finished difference Result 75 states and 190 transitions. [2020-11-30 03:35:29,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 03:35:29,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-11-30 03:35:29,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:35:29,419 INFO L225 Difference]: With dead ends: 75 [2020-11-30 03:35:29,420 INFO L226 Difference]: Without dead ends: 42 [2020-11-30 03:35:29,421 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 03:35:29,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-30 03:35:29,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-30 03:35:29,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-30 03:35:29,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 98 transitions. [2020-11-30 03:35:29,473 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 98 transitions. Word has length 6 [2020-11-30 03:35:29,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:35:29,474 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 98 transitions. [2020-11-30 03:35:29,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 03:35:29,474 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 98 transitions. [2020-11-30 03:35:29,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-30 03:35:29,475 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:35:29,476 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:35:29,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 03:35:29,477 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:35:29,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:35:29,480 INFO L82 PathProgramCache]: Analyzing trace with hash -447013893, now seen corresponding path program 1 times [2020-11-30 03:35:29,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:35:29,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279175093] [2020-11-30 03:35:29,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:35:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:35:29,623 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 03:35:29,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279175093] [2020-11-30 03:35:29,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:35:29,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 03:35:29,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151844445] [2020-11-30 03:35:29,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 03:35:29,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:35:29,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 03:35:29,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 03:35:29,626 INFO L87 Difference]: Start difference. First operand 42 states and 98 transitions. Second operand 5 states. [2020-11-30 03:35:29,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:35:29,681 INFO L93 Difference]: Finished difference Result 56 states and 130 transitions. [2020-11-30 03:35:29,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 03:35:29,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-11-30 03:35:29,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:35:29,684 INFO L225 Difference]: With dead ends: 56 [2020-11-30 03:35:29,684 INFO L226 Difference]: Without dead ends: 50 [2020-11-30 03:35:29,685 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 03:35:29,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-11-30 03:35:29,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2020-11-30 03:35:29,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-30 03:35:29,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 100 transitions. [2020-11-30 03:35:29,696 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 100 transitions. Word has length 8 [2020-11-30 03:35:29,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:35:29,716 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 100 transitions. [2020-11-30 03:35:29,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 03:35:29,717 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 100 transitions. [2020-11-30 03:35:29,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 03:35:29,719 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:35:29,719 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:35:29,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 03:35:29,719 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:35:29,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:35:29,721 INFO L82 PathProgramCache]: Analyzing trace with hash -190894617, now seen corresponding path program 1 times [2020-11-30 03:35:29,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:35:29,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586024394] [2020-11-30 03:35:29,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:35:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:35:29,852 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 03:35:29,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586024394] [2020-11-30 03:35:29,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:35:29,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 03:35:29,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095504616] [2020-11-30 03:35:29,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 03:35:29,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:35:29,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 03:35:29,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 03:35:29,855 INFO L87 Difference]: Start difference. First operand 42 states and 100 transitions. Second operand 6 states. [2020-11-30 03:35:29,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:35:29,933 INFO L93 Difference]: Finished difference Result 54 states and 124 transitions. [2020-11-30 03:35:29,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 03:35:29,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-30 03:35:29,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:35:29,934 INFO L225 Difference]: With dead ends: 54 [2020-11-30 03:35:29,935 INFO L226 Difference]: Without dead ends: 47 [2020-11-30 03:35:29,935 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 03:35:29,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-30 03:35:29,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2020-11-30 03:35:29,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-11-30 03:35:29,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 106 transitions. [2020-11-30 03:35:29,942 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 106 transitions. Word has length 10 [2020-11-30 03:35:29,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:35:29,942 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 106 transitions. [2020-11-30 03:35:29,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 03:35:29,943 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 106 transitions. [2020-11-30 03:35:29,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 03:35:29,944 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:35:29,944 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:35:29,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 03:35:29,944 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:35:29,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:35:29,945 INFO L82 PathProgramCache]: Analyzing trace with hash -83647017, now seen corresponding path program 2 times [2020-11-30 03:35:29,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:35:29,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818477368] [2020-11-30 03:35:29,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:35:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:35:30,025 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 03:35:30,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818477368] [2020-11-30 03:35:30,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:35:30,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 03:35:30,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270253711] [2020-11-30 03:35:30,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 03:35:30,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:35:30,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 03:35:30,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 03:35:30,027 INFO L87 Difference]: Start difference. First operand 45 states and 106 transitions. Second operand 6 states. [2020-11-30 03:35:30,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:35:30,100 INFO L93 Difference]: Finished difference Result 84 states and 192 transitions. [2020-11-30 03:35:30,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 03:35:30,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-30 03:35:30,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:35:30,103 INFO L225 Difference]: With dead ends: 84 [2020-11-30 03:35:30,103 INFO L226 Difference]: Without dead ends: 77 [2020-11-30 03:35:30,103 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 03:35:30,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-30 03:35:30,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 47. [2020-11-30 03:35:30,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-30 03:35:30,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 115 transitions. [2020-11-30 03:35:30,111 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 115 transitions. Word has length 10 [2020-11-30 03:35:30,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:35:30,111 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 115 transitions. [2020-11-30 03:35:30,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 03:35:30,111 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 115 transitions. [2020-11-30 03:35:30,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 03:35:30,112 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:35:30,112 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:35:30,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 03:35:30,113 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:35:30,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:35:30,113 INFO L82 PathProgramCache]: Analyzing trace with hash -83970657, now seen corresponding path program 3 times [2020-11-30 03:35:30,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:35:30,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198099897] [2020-11-30 03:35:30,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:35:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:35:30,208 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 03:35:30,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198099897] [2020-11-30 03:35:30,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:35:30,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 03:35:30,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868646910] [2020-11-30 03:35:30,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 03:35:30,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:35:30,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 03:35:30,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 03:35:30,211 INFO L87 Difference]: Start difference. First operand 47 states and 115 transitions. Second operand 6 states. [2020-11-30 03:35:30,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:35:30,298 INFO L93 Difference]: Finished difference Result 61 states and 139 transitions. [2020-11-30 03:35:30,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 03:35:30,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-30 03:35:30,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:35:30,301 INFO L225 Difference]: With dead ends: 61 [2020-11-30 03:35:30,301 INFO L226 Difference]: Without dead ends: 50 [2020-11-30 03:35:30,301 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 03:35:30,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-11-30 03:35:30,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2020-11-30 03:35:30,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-30 03:35:30,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 96 transitions. [2020-11-30 03:35:30,313 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 96 transitions. Word has length 10 [2020-11-30 03:35:30,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:35:30,313 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 96 transitions. [2020-11-30 03:35:30,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 03:35:30,313 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 96 transitions. [2020-11-30 03:35:30,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 03:35:30,315 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:35:30,315 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:35:30,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 03:35:30,315 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:35:30,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:35:30,316 INFO L82 PathProgramCache]: Analyzing trace with hash -118912617, now seen corresponding path program 4 times [2020-11-30 03:35:30,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:35:30,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907037756] [2020-11-30 03:35:30,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:35:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:35:30,389 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 03:35:30,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907037756] [2020-11-30 03:35:30,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:35:30,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 03:35:30,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281646266] [2020-11-30 03:35:30,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 03:35:30,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:35:30,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 03:35:30,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 03:35:30,392 INFO L87 Difference]: Start difference. First operand 40 states and 96 transitions. Second operand 6 states. [2020-11-30 03:35:30,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:35:30,494 INFO L93 Difference]: Finished difference Result 55 states and 129 transitions. [2020-11-30 03:35:30,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 03:35:30,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-30 03:35:30,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:35:30,499 INFO L225 Difference]: With dead ends: 55 [2020-11-30 03:35:30,499 INFO L226 Difference]: Without dead ends: 49 [2020-11-30 03:35:30,499 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 03:35:30,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-11-30 03:35:30,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2020-11-30 03:35:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-11-30 03:35:30,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 99 transitions. [2020-11-30 03:35:30,510 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 99 transitions. Word has length 10 [2020-11-30 03:35:30,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:35:30,510 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 99 transitions. [2020-11-30 03:35:30,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 03:35:30,511 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 99 transitions. [2020-11-30 03:35:30,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-30 03:35:30,512 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:35:30,512 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:35:30,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 03:35:30,513 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:35:30,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:35:30,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1691902418, now seen corresponding path program 5 times [2020-11-30 03:35:30,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:35:30,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416385913] [2020-11-30 03:35:30,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:35:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:35:30,593 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 03:35:30,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416385913] [2020-11-30 03:35:30,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102182070] [2020-11-30 03:35:30,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f38c4c33-1368-4d6c-ad2e-036bae421b4b/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 03:35:30,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-11-30 03:35:30,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 03:35:30,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 03:35:30,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:35:30,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 03:35:30,840 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 03:35:30,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:35:30,844 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 03:35:30,844 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:30,876 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 03:35:30,877 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:30,911 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:30,985 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 03:35:30,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [477339476] [2020-11-30 03:35:30,991 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 03:35:31,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 03:35:31,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2020-11-30 03:35:31,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780757173] [2020-11-30 03:35:31,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-30 03:35:31,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:35:31,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-30 03:35:31,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-11-30 03:35:31,006 INFO L87 Difference]: Start difference. First operand 41 states and 99 transitions. Second operand 13 states. [2020-11-30 03:35:31,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:35:31,280 INFO L93 Difference]: Finished difference Result 82 states and 197 transitions. [2020-11-30 03:35:31,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 03:35:31,280 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2020-11-30 03:35:31,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:35:31,281 INFO L225 Difference]: With dead ends: 82 [2020-11-30 03:35:31,281 INFO L226 Difference]: Without dead ends: 56 [2020-11-30 03:35:31,282 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 03:35:31,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-11-30 03:35:31,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2020-11-30 03:35:31,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-30 03:35:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 97 transitions. [2020-11-30 03:35:31,287 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 97 transitions. Word has length 11 [2020-11-30 03:35:31,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:35:31,287 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 97 transitions. [2020-11-30 03:35:31,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-30 03:35:31,288 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 97 transitions. [2020-11-30 03:35:31,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 03:35:31,288 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:35:31,288 INFO L422 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:35:31,515 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-11-30 03:35:31,515 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:35:31,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:35:31,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1230025166, now seen corresponding path program 6 times [2020-11-30 03:35:31,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:35:31,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980131132] [2020-11-30 03:35:31,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:35:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:35:31,627 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 03:35:31,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980131132] [2020-11-30 03:35:31,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520014230] [2020-11-30 03:35:31,627 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f38c4c33-1368-4d6c-ad2e-036bae421b4b/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 03:35:31,688 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 03:35:31,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 03:35:31,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 03:35:31,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:35:31,722 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 03:35:31,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:35:31,725 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 03:35:31,725 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:31,745 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:31,763 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:31,783 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:31,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:31,821 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:31,842 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 03:35:31,842 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:31,866 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 03:35:31,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [721199883] [2020-11-30 03:35:31,868 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 03:35:31,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 03:35:31,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2020-11-30 03:35:31,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398666128] [2020-11-30 03:35:31,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-30 03:35:31,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:35:31,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-30 03:35:31,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-11-30 03:35:31,874 INFO L87 Difference]: Start difference. First operand 40 states and 97 transitions. Second operand 16 states. [2020-11-30 03:35:32,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:35:32,155 INFO L93 Difference]: Finished difference Result 91 states and 202 transitions. [2020-11-30 03:35:32,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-30 03:35:32,156 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2020-11-30 03:35:32,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:35:32,157 INFO L225 Difference]: With dead ends: 91 [2020-11-30 03:35:32,157 INFO L226 Difference]: Without dead ends: 66 [2020-11-30 03:35:32,158 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2020-11-30 03:35:32,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-11-30 03:35:32,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2020-11-30 03:35:32,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-11-30 03:35:32,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 136 transitions. [2020-11-30 03:35:32,170 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 136 transitions. Word has length 14 [2020-11-30 03:35:32,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:35:32,171 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 136 transitions. [2020-11-30 03:35:32,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-30 03:35:32,171 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 136 transitions. [2020-11-30 03:35:32,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 03:35:32,172 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:35:32,172 INFO L422 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:35:32,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:35:32,395 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:35:32,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:35:32,396 INFO L82 PathProgramCache]: Analyzing trace with hash 415819444, now seen corresponding path program 7 times [2020-11-30 03:35:32,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:35:32,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711001896] [2020-11-30 03:35:32,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:35:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:35:32,478 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 03:35:32,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711001896] [2020-11-30 03:35:32,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041464698] [2020-11-30 03:35:32,479 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f38c4c33-1368-4d6c-ad2e-036bae421b4b/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 03:35:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:35:32,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 03:35:32,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:35:32,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 03:35:32,597 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 03:35:32,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:35:32,599 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 03:35:32,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:32,622 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 03:35:32,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:32,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:32,727 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 03:35:32,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1411428477] [2020-11-30 03:35:32,728 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 03:35:32,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 03:35:32,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2020-11-30 03:35:32,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787148873] [2020-11-30 03:35:32,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-30 03:35:32,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:35:32,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-30 03:35:32,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2020-11-30 03:35:32,730 INFO L87 Difference]: Start difference. First operand 58 states and 136 transitions. Second operand 17 states. [2020-11-30 03:35:33,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:35:33,322 INFO L93 Difference]: Finished difference Result 157 states and 377 transitions. [2020-11-30 03:35:33,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-30 03:35:33,323 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2020-11-30 03:35:33,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:35:33,324 INFO L225 Difference]: With dead ends: 157 [2020-11-30 03:35:33,324 INFO L226 Difference]: Without dead ends: 108 [2020-11-30 03:35:33,325 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=478, Invalid=1004, Unknown=0, NotChecked=0, Total=1482 [2020-11-30 03:35:33,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-11-30 03:35:33,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 65. [2020-11-30 03:35:33,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-30 03:35:33,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 161 transitions. [2020-11-30 03:35:33,341 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 161 transitions. Word has length 14 [2020-11-30 03:35:33,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:35:33,342 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 161 transitions. [2020-11-30 03:35:33,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-30 03:35:33,342 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 161 transitions. [2020-11-30 03:35:33,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-30 03:35:33,345 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:35:33,345 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:35:33,571 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:35:33,571 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:35:33,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:35:33,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1483738395, now seen corresponding path program 8 times [2020-11-30 03:35:33,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:35:33,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265611136] [2020-11-30 03:35:33,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:35:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:35:33,725 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 03:35:33,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265611136] [2020-11-30 03:35:33,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539153519] [2020-11-30 03:35:33,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f38c4c33-1368-4d6c-ad2e-036bae421b4b/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 03:35:33,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-11-30 03:35:33,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 03:35:33,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-30 03:35:33,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:35:33,834 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 03:35:33,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:35:33,835 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 03:35:33,836 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:33,863 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 03:35:33,863 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:34,061 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 03:35:34,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [497923351] [2020-11-30 03:35:34,062 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 03:35:34,063 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 03:35:34,063 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2020-11-30 03:35:34,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755542818] [2020-11-30 03:35:34,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-30 03:35:34,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:35:34,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-30 03:35:34,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2020-11-30 03:35:34,065 INFO L87 Difference]: Start difference. First operand 65 states and 161 transitions. Second operand 25 states. [2020-11-30 03:35:35,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:35:35,038 INFO L93 Difference]: Finished difference Result 210 states and 515 transitions. [2020-11-30 03:35:35,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-11-30 03:35:35,038 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 17 [2020-11-30 03:35:35,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:35:35,039 INFO L225 Difference]: With dead ends: 210 [2020-11-30 03:35:35,039 INFO L226 Difference]: Without dead ends: 129 [2020-11-30 03:35:35,041 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1176, Invalid=2606, Unknown=0, NotChecked=0, Total=3782 [2020-11-30 03:35:35,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-11-30 03:35:35,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 64. [2020-11-30 03:35:35,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-30 03:35:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 157 transitions. [2020-11-30 03:35:35,048 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 157 transitions. Word has length 17 [2020-11-30 03:35:35,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:35:35,049 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 157 transitions. [2020-11-30 03:35:35,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-30 03:35:35,049 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 157 transitions. [2020-11-30 03:35:35,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-30 03:35:35,050 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:35:35,050 INFO L422 BasicCegarLoop]: trace histogram [10, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:35:35,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:35:35,267 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:35:35,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:35:35,267 INFO L82 PathProgramCache]: Analyzing trace with hash -154578414, now seen corresponding path program 9 times [2020-11-30 03:35:35,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:35:35,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321889118] [2020-11-30 03:35:35,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:35:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:35:35,587 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:35:35,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321889118] [2020-11-30 03:35:35,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646676159] [2020-11-30 03:35:35,588 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f38c4c33-1368-4d6c-ad2e-036bae421b4b/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:35:35,653 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 03:35:35,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 03:35:35,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2020-11-30 03:35:35,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:35:35,699 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:35:35,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:35:35,701 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 03:35:35,701 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:35,730 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:35,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:35,782 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:35,806 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:35,847 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:35,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:35,903 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:35,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:35,947 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:35,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:35,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:36,026 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:36,052 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:36,077 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:36,102 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:36,145 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:36,181 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:36,208 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 03:35:36,209 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:36,237 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:35:36,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1536055633] [2020-11-30 03:35:36,238 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 03:35:36,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 03:35:36,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2020-11-30 03:35:36,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469698299] [2020-11-30 03:35:36,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 40 states [2020-11-30 03:35:36,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:35:36,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2020-11-30 03:35:36,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1165, Unknown=0, NotChecked=0, Total=1560 [2020-11-30 03:35:36,241 INFO L87 Difference]: Start difference. First operand 64 states and 157 transitions. Second operand 40 states. [2020-11-30 03:35:37,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:35:37,218 INFO L93 Difference]: Finished difference Result 181 states and 394 transitions. [2020-11-30 03:35:37,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-11-30 03:35:37,219 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 26 [2020-11-30 03:35:37,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:35:37,220 INFO L225 Difference]: With dead ends: 181 [2020-11-30 03:35:37,220 INFO L226 Difference]: Without dead ends: 120 [2020-11-30 03:35:37,222 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1165 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1745, Invalid=3805, Unknown=0, NotChecked=0, Total=5550 [2020-11-30 03:35:37,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-11-30 03:35:37,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 100. [2020-11-30 03:35:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-11-30 03:35:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 232 transitions. [2020-11-30 03:35:37,241 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 232 transitions. Word has length 26 [2020-11-30 03:35:37,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:35:37,241 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 232 transitions. [2020-11-30 03:35:37,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2020-11-30 03:35:37,242 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 232 transitions. [2020-11-30 03:35:37,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-30 03:35:37,244 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:35:37,245 INFO L422 BasicCegarLoop]: trace histogram [10, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:35:37,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-11-30 03:35:37,458 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:35:37,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:35:37,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1558563116, now seen corresponding path program 10 times [2020-11-30 03:35:37,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:35:37,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397413014] [2020-11-30 03:35:37,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:35:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:35:37,653 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:35:37,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397413014] [2020-11-30 03:35:37,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195082198] [2020-11-30 03:35:37,653 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f38c4c33-1368-4d6c-ad2e-036bae421b4b/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:35:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:35:37,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2020-11-30 03:35:37,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:35:37,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 03:35:37,774 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:35:37,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:35:37,779 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 03:35:37,779 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:37,798 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 03:35:37,798 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:37,851 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:38,258 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:35:38,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [399336892] [2020-11-30 03:35:38,259 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 03:35:38,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 03:35:38,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 39 [2020-11-30 03:35:38,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429632977] [2020-11-30 03:35:38,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-11-30 03:35:38,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:35:38,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-11-30 03:35:38,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=1240, Unknown=0, NotChecked=0, Total=1640 [2020-11-30 03:35:38,262 INFO L87 Difference]: Start difference. First operand 100 states and 232 transitions. Second operand 41 states. [2020-11-30 03:35:40,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:35:40,697 INFO L93 Difference]: Finished difference Result 352 states and 851 transitions. [2020-11-30 03:35:40,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2020-11-30 03:35:40,698 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 26 [2020-11-30 03:35:40,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:35:40,700 INFO L225 Difference]: With dead ends: 352 [2020-11-30 03:35:40,700 INFO L226 Difference]: Without dead ends: 229 [2020-11-30 03:35:40,704 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4112 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3796, Invalid=8414, Unknown=0, NotChecked=0, Total=12210 [2020-11-30 03:35:40,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-11-30 03:35:40,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 104. [2020-11-30 03:35:40,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-11-30 03:35:40,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 254 transitions. [2020-11-30 03:35:40,724 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 254 transitions. Word has length 26 [2020-11-30 03:35:40,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:35:40,724 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 254 transitions. [2020-11-30 03:35:40,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-11-30 03:35:40,725 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 254 transitions. [2020-11-30 03:35:40,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-30 03:35:40,729 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:35:40,730 INFO L422 BasicCegarLoop]: trace histogram [17, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:35:40,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:35:40,943 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:35:40,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:35:40,943 INFO L82 PathProgramCache]: Analyzing trace with hash 349348741, now seen corresponding path program 11 times [2020-11-30 03:35:40,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:35:40,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237124841] [2020-11-30 03:35:40,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:35:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:35:41,400 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:35:41,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237124841] [2020-11-30 03:35:41,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593835413] [2020-11-30 03:35:41,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f38c4c33-1368-4d6c-ad2e-036bae421b4b/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:35:41,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2020-11-30 03:35:41,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 03:35:41,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 35 conjunts are in the unsatisfiable core [2020-11-30 03:35:41,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:35:41,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 03:35:41,640 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:35:41,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:35:41,641 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 03:35:41,642 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:41,671 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 03:35:41,671 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:41,706 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:42,628 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:35:42,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [390314337] [2020-11-30 03:35:42,630 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 03:35:42,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 03:35:42,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 67 [2020-11-30 03:35:42,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109495805] [2020-11-30 03:35:42,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 69 states [2020-11-30 03:35:42,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:35:42,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2020-11-30 03:35:42,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1096, Invalid=3596, Unknown=0, NotChecked=0, Total=4692 [2020-11-30 03:35:42,637 INFO L87 Difference]: Start difference. First operand 104 states and 254 transitions. Second operand 69 states. [2020-11-30 03:35:45,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:35:45,543 INFO L93 Difference]: Finished difference Result 316 states and 779 transitions. [2020-11-30 03:35:45,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2020-11-30 03:35:45,543 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 40 [2020-11-30 03:35:45,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:35:45,545 INFO L225 Difference]: With dead ends: 316 [2020-11-30 03:35:45,546 INFO L226 Difference]: Without dead ends: 256 [2020-11-30 03:35:45,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6731 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=6198, Invalid=14972, Unknown=0, NotChecked=0, Total=21170 [2020-11-30 03:35:45,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-11-30 03:35:45,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 106. [2020-11-30 03:35:45,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-11-30 03:35:45,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 262 transitions. [2020-11-30 03:35:45,559 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 262 transitions. Word has length 40 [2020-11-30 03:35:45,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:35:45,560 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 262 transitions. [2020-11-30 03:35:45,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2020-11-30 03:35:45,560 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 262 transitions. [2020-11-30 03:35:45,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-30 03:35:45,561 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:35:45,561 INFO L422 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:35:45,775 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:35:45,775 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:35:45,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:35:45,776 INFO L82 PathProgramCache]: Analyzing trace with hash 948834309, now seen corresponding path program 12 times [2020-11-30 03:35:45,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:35:45,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743536790] [2020-11-30 03:35:45,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:35:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:35:46,683 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:35:46,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743536790] [2020-11-30 03:35:46,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445117535] [2020-11-30 03:35:46,684 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f38c4c33-1368-4d6c-ad2e-036bae421b4b/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:35:46,779 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 03:35:46,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 03:35:46,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 43 conjunts are in the unsatisfiable core [2020-11-30 03:35:46,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:35:46,835 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:35:46,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:35:46,836 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 03:35:46,837 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:46,886 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:46,929 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:46,960 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:46,990 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:46,996 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,006 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,010 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,012 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,014 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,016 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,018 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,020 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,022 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,024 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,026 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,028 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,030 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,032 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,034 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,036 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,039 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,041 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,043 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,060 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,062 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,064 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,065 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,070 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,072 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,073 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,074 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,075 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,077 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,078 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,079 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,084 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,087 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 03:35:47,087 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:47,135 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:35:47,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [211410857] [2020-11-30 03:35:47,137 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 03:35:47,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 03:35:47,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 46 [2020-11-30 03:35:47,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520452237] [2020-11-30 03:35:47,144 INFO L461 AbstractCegarLoop]: Interpolant automaton has 48 states [2020-11-30 03:35:47,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:35:47,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2020-11-30 03:35:47,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=1696, Unknown=0, NotChecked=0, Total=2256 [2020-11-30 03:35:47,148 INFO L87 Difference]: Start difference. First operand 106 states and 262 transitions. Second operand 48 states. [2020-11-30 03:35:48,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:35:48,535 INFO L93 Difference]: Finished difference Result 178 states and 409 transitions. [2020-11-30 03:35:48,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2020-11-30 03:35:48,536 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2020-11-30 03:35:48,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:35:48,537 INFO L225 Difference]: With dead ends: 178 [2020-11-30 03:35:48,537 INFO L226 Difference]: Without dead ends: 160 [2020-11-30 03:35:48,540 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2544, Invalid=5646, Unknown=0, NotChecked=0, Total=8190 [2020-11-30 03:35:48,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-11-30 03:35:48,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 120. [2020-11-30 03:35:48,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-11-30 03:35:48,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 293 transitions. [2020-11-30 03:35:48,545 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 293 transitions. Word has length 47 [2020-11-30 03:35:48,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:35:48,545 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 293 transitions. [2020-11-30 03:35:48,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2020-11-30 03:35:48,545 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 293 transitions. [2020-11-30 03:35:48,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-30 03:35:48,546 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:35:48,547 INFO L422 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:35:48,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-11-30 03:35:48,763 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:35:48,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:35:48,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1830374497, now seen corresponding path program 13 times [2020-11-30 03:35:48,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:35:48,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010726037] [2020-11-30 03:35:48,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:35:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:35:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:35:49,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010726037] [2020-11-30 03:35:49,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297730541] [2020-11-30 03:35:49,424 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f38c4c33-1368-4d6c-ad2e-036bae421b4b/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:35:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:35:49,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 43 conjunts are in the unsatisfiable core [2020-11-30 03:35:49,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:35:49,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 03:35:49,587 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:35:49,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:35:49,588 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 03:35:49,588 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:49,621 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 03:35:49,621 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:49,648 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:35:49,803 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:35:49,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2088970217] [2020-11-30 03:35:49,804 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 03:35:49,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 03:35:49,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 48 [2020-11-30 03:35:49,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105466412] [2020-11-30 03:35:49,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 50 states [2020-11-30 03:35:49,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:35:49,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2020-11-30 03:35:49,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=1896, Unknown=0, NotChecked=0, Total=2450 [2020-11-30 03:35:49,808 INFO L87 Difference]: Start difference. First operand 120 states and 293 transitions. Second operand 50 states. [2020-11-30 03:35:53,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:35:53,146 INFO L93 Difference]: Finished difference Result 280 states and 671 transitions. [2020-11-30 03:35:53,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2020-11-30 03:35:53,146 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 47 [2020-11-30 03:35:53,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:35:53,148 INFO L225 Difference]: With dead ends: 280 [2020-11-30 03:35:53,148 INFO L226 Difference]: Without dead ends: 245 [2020-11-30 03:35:53,150 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5608 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5722, Invalid=12910, Unknown=0, NotChecked=0, Total=18632 [2020-11-30 03:35:53,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2020-11-30 03:35:53,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 121. [2020-11-30 03:35:53,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-11-30 03:35:53,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 297 transitions. [2020-11-30 03:35:53,156 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 297 transitions. Word has length 47 [2020-11-30 03:35:53,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:35:53,157 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 297 transitions. [2020-11-30 03:35:53,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2020-11-30 03:35:53,157 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 297 transitions. [2020-11-30 03:35:53,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-30 03:35:53,158 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:35:53,158 INFO L422 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:35:53,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-11-30 03:35:53,379 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 03:35:53,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:35:53,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1666611019, now seen corresponding path program 14 times [2020-11-30 03:35:53,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:35:53,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436032630] [2020-11-30 03:35:53,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:35:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:35:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 342 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:35:53,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436032630] [2020-11-30 03:35:53,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578771779] [2020-11-30 03:35:53,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f38c4c33-1368-4d6c-ad2e-036bae421b4b/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:35:53,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2020-11-30 03:35:53,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 03:35:53,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 22 conjunts are in the unsatisfiable core [2020-11-30 03:35:53,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:35:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:35:53,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:35:53,960 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:35:53,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-11-30 03:35:53,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23, 23] imperfect sequences [23] total 25 [2020-11-30 03:35:53,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901248188] [2020-11-30 03:35:53,962 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-30 03:35:53,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:35:53,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-30 03:35:53,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=340, Unknown=0, NotChecked=0, Total=600 [2020-11-30 03:35:53,963 INFO L87 Difference]: Start difference. First operand 121 states and 297 transitions. Second operand 23 states. [2020-11-30 03:35:54,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:35:54,025 INFO L93 Difference]: Finished difference Result 1019 states and 2433 transitions. [2020-11-30 03:35:54,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-30 03:35:54,026 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 49 [2020-11-30 03:35:54,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:35:54,026 INFO L225 Difference]: With dead ends: 1019 [2020-11-30 03:35:54,027 INFO L226 Difference]: Without dead ends: 0 [2020-11-30 03:35:54,027 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=260, Invalid=340, Unknown=0, NotChecked=0, Total=600 [2020-11-30 03:35:54,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-30 03:35:54,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-30 03:35:54,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-30 03:35:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-30 03:35:54,028 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2020-11-30 03:35:54,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:35:54,028 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 03:35:54,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-30 03:35:54,029 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-30 03:35:54,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-30 03:35:54,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-11-30 03:35:54,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:35:54 BasicIcfg [2020-11-30 03:35:54,249 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 03:35:54,250 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 03:35:54,250 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 03:35:54,250 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 03:35:54,250 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:35:26" (3/4) ... [2020-11-30 03:35:54,253 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-30 03:35:54,259 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure t1 [2020-11-30 03:35:54,259 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure t2 [2020-11-30 03:35:54,263 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2020-11-30 03:35:54,263 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-11-30 03:35:54,263 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-11-30 03:35:54,264 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-30 03:35:54,316 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f38c4c33-1368-4d6c-ad2e-036bae421b4b/bin/utaipan/witness.graphml [2020-11-30 03:35:54,316 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 03:35:54,318 INFO L168 Benchmark]: Toolchain (without parser) took 28941.99 ms. Allocated memory was 104.9 MB in the beginning and 394.3 MB in the end (delta: 289.4 MB). Free memory was 75.5 MB in the beginning and 338.0 MB in the end (delta: -262.5 MB). Peak memory consumption was 27.0 MB. Max. memory is 16.1 GB. [2020-11-30 03:35:54,318 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 104.9 MB. Free memory was 62.1 MB in the beginning and 62.1 MB in the end (delta: 43.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 03:35:54,319 INFO L168 Benchmark]: CACSL2BoogieTranslator took 567.56 ms. Allocated memory was 104.9 MB in the beginning and 125.8 MB in the end (delta: 21.0 MB). Free memory was 75.1 MB in the beginning and 82.5 MB in the end (delta: -7.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-30 03:35:54,319 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.23 ms. Allocated memory is still 125.8 MB. Free memory was 82.5 MB in the beginning and 80.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 03:35:54,320 INFO L168 Benchmark]: Boogie Preprocessor took 40.93 ms. Allocated memory is still 125.8 MB. Free memory was 80.7 MB in the beginning and 79.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 03:35:54,320 INFO L168 Benchmark]: RCFGBuilder took 558.44 ms. Allocated memory is still 125.8 MB. Free memory was 79.3 MB in the beginning and 59.4 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-30 03:35:54,321 INFO L168 Benchmark]: TraceAbstraction took 27634.29 ms. Allocated memory was 125.8 MB in the beginning and 394.3 MB in the end (delta: 268.4 MB). Free memory was 58.9 MB in the beginning and 340.4 MB in the end (delta: -281.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 03:35:54,321 INFO L168 Benchmark]: Witness Printer took 66.90 ms. Allocated memory is still 394.3 MB. Free memory was 340.4 MB in the beginning and 338.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 03:35:54,323 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.26 ms. Allocated memory is still 104.9 MB. Free memory was 62.1 MB in the beginning and 62.1 MB in the end (delta: 43.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 567.56 ms. Allocated memory was 104.9 MB in the beginning and 125.8 MB in the end (delta: 21.0 MB). Free memory was 75.1 MB in the beginning and 82.5 MB in the end (delta: -7.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 67.23 ms. Allocated memory is still 125.8 MB. Free memory was 82.5 MB in the beginning and 80.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 40.93 ms. Allocated memory is still 125.8 MB. Free memory was 80.7 MB in the beginning and 79.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 558.44 ms. Allocated memory is still 125.8 MB. Free memory was 79.3 MB in the beginning and 59.4 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 27634.29 ms. Allocated memory was 125.8 MB in the beginning and 394.3 MB in the end (delta: 268.4 MB). Free memory was 58.9 MB in the beginning and 340.4 MB in the end (delta: -281.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 66.90 ms. Allocated memory is still 394.3 MB. Free memory was 340.4 MB in the beginning and 338.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 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.3s, 65 PlacesBefore, 20 PlacesAfterwards, 64 TransitionsBefore, 16 TransitionsAfterwards, 1144 CoEnabledTransitionPairs, 5 FixpointIterations, 16 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 60 TotalNumberOfCompositions, 1062 MoverChecksTotal - PositiveResult [Line: 693]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 27.5s, OverallIterations: 16, TraceHistogramMax: 21, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 344 SDtfs, 3026 SDslu, 1592 SDs, 0 SdLazy, 1731 SolverSat, 2223 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1196 GetRequests, 435 SyntacticMatches, 9 SemanticMatches, 752 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21001 ImplicationChecksByTransitivity, 16.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 649 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 636 NumberOfCodeBlocks, 636 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 891 ConstructedInterpolants, 0 QuantifiedInterpolants, 124969 SizeOfPredicates, 165 NumberOfNonLiveVariables, 1835 ConjunctsInSsa, 224 ConjunctsInUnsatCore, 36 InterpolantComputations, 8 PerfectInterpolantSequences, 1157/4620 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...