./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix057_rmo.opt.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_8310da19-7d70-4b9e-81be-983024de89ba/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_8310da19-7d70-4b9e-81be-983024de89ba/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8310da19-7d70-4b9e-81be-983024de89ba/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8310da19-7d70-4b9e-81be-983024de89ba/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix057_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8310da19-7d70-4b9e-81be-983024de89ba/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8310da19-7d70-4b9e-81be-983024de89ba/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9f0d6f00c4a03763e12a033ab517f3e7d39b81a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 00:15:31,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:15:31,589 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:15:31,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:15:31,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:15:31,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:15:31,656 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:15:31,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:15:31,662 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:15:31,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:15:31,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:15:31,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:15:31,668 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:15:31,669 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:15:31,671 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:15:31,673 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:15:31,674 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:15:31,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:15:31,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:15:31,681 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:15:31,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:15:31,685 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:15:31,686 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:15:31,688 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:15:31,692 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:15:31,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:15:31,693 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:15:31,694 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:15:31,695 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:15:31,696 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:15:31,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:15:31,698 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:15:31,699 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:15:31,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:15:31,702 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:15:31,703 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:15:31,704 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:15:31,704 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:15:31,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:15:31,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:15:31,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:15:31,709 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8310da19-7d70-4b9e-81be-983024de89ba/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 00:15:31,737 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:15:31,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:15:31,739 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:15:31,739 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:15:31,740 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:15:31,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:15:31,741 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:15:31,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:15:31,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:15:31,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:15:31,742 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 00:15:31,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 00:15:31,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 00:15:31,743 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:15:31,743 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:15:31,743 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:15:31,744 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 00:15:31,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:15:31,745 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:15:31,745 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 00:15:31,745 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 00:15:31,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:15:31,746 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:15:31,746 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 00:15:31,747 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 00:15:31,747 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:15:31,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 00:15:31,747 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 00:15:31,748 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:15:31,748 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_8310da19-7d70-4b9e-81be-983024de89ba/bin/uautomizer/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_8310da19-7d70-4b9e-81be-983024de89ba/bin/uautomizer 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 -> Automizer 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 -> b9f0d6f00c4a03763e12a033ab517f3e7d39b81a [2020-11-30 00:15:32,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:15:32,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:15:32,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:15:32,099 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:15:32,105 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:15:32,106 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8310da19-7d70-4b9e-81be-983024de89ba/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix057_rmo.opt.i [2020-11-30 00:15:32,184 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8310da19-7d70-4b9e-81be-983024de89ba/bin/uautomizer/data/47a4a456d/32e5c35a10f2472289a1998f69e3a552/FLAGd116cdf2e [2020-11-30 00:15:33,067 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:15:33,074 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8310da19-7d70-4b9e-81be-983024de89ba/sv-benchmarks/c/pthread-wmm/mix057_rmo.opt.i [2020-11-30 00:15:33,116 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8310da19-7d70-4b9e-81be-983024de89ba/bin/uautomizer/data/47a4a456d/32e5c35a10f2472289a1998f69e3a552/FLAGd116cdf2e [2020-11-30 00:15:33,262 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8310da19-7d70-4b9e-81be-983024de89ba/bin/uautomizer/data/47a4a456d/32e5c35a10f2472289a1998f69e3a552 [2020-11-30 00:15:33,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:15:33,275 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:15:33,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:15:33,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:15:33,283 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:15:33,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:15:33" (1/1) ... [2020-11-30 00:15:33,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2473e702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:15:33, skipping insertion in model container [2020-11-30 00:15:33,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:15:33" (1/1) ... [2020-11-30 00:15:33,299 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:15:33,395 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:15:33,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:15:33,922 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:15:34,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:15:34,134 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:15:34,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:15:34 WrapperNode [2020-11-30 00:15:34,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:15:34,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:15:34,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:15:34,137 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:15:34,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:15:34" (1/1) ... [2020-11-30 00:15:34,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:15:34" (1/1) ... [2020-11-30 00:15:34,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:15:34,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:15:34,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:15:34,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:15:34,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:15:34" (1/1) ... [2020-11-30 00:15:34,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:15:34" (1/1) ... [2020-11-30 00:15:34,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:15:34" (1/1) ... [2020-11-30 00:15:34,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:15:34" (1/1) ... [2020-11-30 00:15:34,251 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:15:34" (1/1) ... [2020-11-30 00:15:34,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:15:34" (1/1) ... [2020-11-30 00:15:34,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:15:34" (1/1) ... [2020-11-30 00:15:34,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:15:34,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:15:34,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:15:34,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:15:34,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:15:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8310da19-7d70-4b9e-81be-983024de89ba/bin/uautomizer/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 00:15:34,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 00:15:34,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-30 00:15:34,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:15:34,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 00:15:34,365 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-30 00:15:34,365 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-30 00:15:34,365 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-30 00:15:34,366 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-30 00:15:34,366 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-30 00:15:34,366 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-30 00:15:34,366 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-30 00:15:34,366 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-30 00:15:34,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 00:15:34,367 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-30 00:15:34,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:15:34,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:15:34,370 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-30 00:15:37,732 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:15:37,732 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-30 00:15:37,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:15:37 BoogieIcfgContainer [2020-11-30 00:15:37,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:15:37,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 00:15:37,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 00:15:37,742 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 00:15:37,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:15:33" (1/3) ... [2020-11-30 00:15:37,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9073a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:15:37, skipping insertion in model container [2020-11-30 00:15:37,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:15:34" (2/3) ... [2020-11-30 00:15:37,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9073a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:15:37, skipping insertion in model container [2020-11-30 00:15:37,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:15:37" (3/3) ... [2020-11-30 00:15:37,748 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_rmo.opt.i [2020-11-30 00:15:37,762 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-30 00:15:37,763 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 00:15:37,767 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-30 00:15:37,768 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-30 00:15:37,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,812 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,812 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,813 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,813 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,813 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,814 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,815 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,815 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,816 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,816 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,819 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,819 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,820 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,820 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,820 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,820 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,821 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,821 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,821 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,822 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,822 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,822 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,822 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,822 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,823 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,823 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,823 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,824 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,824 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,824 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,824 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,825 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,825 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,828 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,828 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,828 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,829 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,830 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,830 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,830 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,830 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,831 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,831 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,831 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,834 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,834 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,836 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,836 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,837 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,837 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,839 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,839 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,839 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,839 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,840 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,840 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,840 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,840 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,840 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,841 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:15:37,843 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-30 00:15:37,857 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-30 00:15:37,894 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 00:15:37,894 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 00:15:37,894 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 00:15:37,894 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:15:37,894 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:15:37,895 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 00:15:37,895 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:15:37,896 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 00:15:37,917 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-30 00:15:37,923 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 116 transitions, 252 flow [2020-11-30 00:15:37,927 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 116 transitions, 252 flow [2020-11-30 00:15:37,929 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 126 places, 116 transitions, 252 flow [2020-11-30 00:15:38,021 INFO L129 PetriNetUnfolder]: 3/112 cut-off events. [2020-11-30 00:15:38,021 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-30 00:15:38,026 INFO L80 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 3/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2020-11-30 00:15:38,032 INFO L116 LiptonReduction]: Number of co-enabled transitions 2622 [2020-11-30 00:15:38,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 00:15:38,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:15:38,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 00:15:38,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:15:38,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:15:38,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:15:38,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:15:38,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:15:38,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:15:38,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:15:38,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:15:38,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:15:39,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 00:15:39,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:15:39,601 WARN L193 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-30 00:15:39,780 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-30 00:15:40,047 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-30 00:15:40,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:15:40,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:15:40,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:15:40,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:15:40,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:15:40,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:15:40,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:15:40,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:15:40,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:15:40,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:15:40,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:15:40,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:15:40,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:15:40,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:15:40,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:15:40,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:15:40,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:15:40,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:15:40,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:15:40,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:15:40,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:15:40,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:15:40,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:15:40,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:15:40,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:15:40,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:15:40,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:15:40,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:15:40,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:15:40,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:15:40,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:15:40,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:15:40,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:15:40,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:15:40,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:15:40,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:15:40,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:15:40,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:15:40,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:15:40,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:15:40,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:15:40,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:15:40,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:15:40,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:15:40,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:15:40,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:15:40,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:15:40,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:15:40,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:15:40,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:15:40,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:15:40,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:15:40,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:15:40,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:15:40,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:15:40,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:15:41,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:15:41,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:15:41,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:15:41,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:15:41,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:15:41,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:15:41,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:15:41,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:15:41,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 00:15:41,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:15:41,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:15:41,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:15:41,449 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:15:41,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:15:41,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:15:41,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:15:41,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:15:41,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:15:43,137 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-11-30 00:15:43,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-11-30 00:15:43,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:15:43,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:15:43,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:15:44,592 WARN L193 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2020-11-30 00:15:45,434 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-11-30 00:15:45,841 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-30 00:15:46,465 WARN L193 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-11-30 00:15:46,654 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-30 00:15:46,701 INFO L131 LiptonReduction]: Checked pairs total: 6442 [2020-11-30 00:15:46,701 INFO L133 LiptonReduction]: Total number of compositions: 98 [2020-11-30 00:15:46,707 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2020-11-30 00:15:46,982 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3082 states. [2020-11-30 00:15:46,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states. [2020-11-30 00:15:46,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 00:15:46,993 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:46,994 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:15:46,994 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:47,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:47,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1604801105, now seen corresponding path program 1 times [2020-11-30 00:15:47,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:47,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316741453] [2020-11-30 00:15:47,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:47,338 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 00:15:47,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316741453] [2020-11-30 00:15:47,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:47,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-30 00:15:47,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425437404] [2020-11-30 00:15:47,346 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:15:47,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:47,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:15:47,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:47,367 INFO L87 Difference]: Start difference. First operand 3082 states. Second operand 3 states. [2020-11-30 00:15:47,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:47,487 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-11-30 00:15:47,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:15:47,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-30 00:15:47,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:47,540 INFO L225 Difference]: With dead ends: 2602 [2020-11-30 00:15:47,541 INFO L226 Difference]: Without dead ends: 2202 [2020-11-30 00:15:47,545 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:15:47,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2020-11-30 00:15:47,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 2202. [2020-11-30 00:15:47,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2020-11-30 00:15:47,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 8424 transitions. [2020-11-30 00:15:47,720 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 8424 transitions. Word has length 9 [2020-11-30 00:15:47,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:47,721 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 8424 transitions. [2020-11-30 00:15:47,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:15:47,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 8424 transitions. [2020-11-30 00:15:47,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-30 00:15:47,725 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:47,726 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:15:47,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 00:15:47,726 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:47,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:47,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1351042416, now seen corresponding path program 1 times [2020-11-30 00:15:47,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:47,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340401830] [2020-11-30 00:15:47,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:47,948 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 00:15:47,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340401830] [2020-11-30 00:15:47,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:47,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:47,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780570506] [2020-11-30 00:15:47,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:15:47,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:47,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:15:47,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:15:47,951 INFO L87 Difference]: Start difference. First operand 2202 states and 8424 transitions. Second operand 5 states. [2020-11-30 00:15:48,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:48,142 INFO L93 Difference]: Finished difference Result 2582 states and 9578 transitions. [2020-11-30 00:15:48,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:15:48,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-30 00:15:48,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:48,177 INFO L225 Difference]: With dead ends: 2582 [2020-11-30 00:15:48,178 INFO L226 Difference]: Without dead ends: 2182 [2020-11-30 00:15:48,178 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:15:48,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2020-11-30 00:15:48,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2182. [2020-11-30 00:15:48,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2182 states. [2020-11-30 00:15:48,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 8328 transitions. [2020-11-30 00:15:48,284 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 8328 transitions. Word has length 12 [2020-11-30 00:15:48,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:48,284 INFO L481 AbstractCegarLoop]: Abstraction has 2182 states and 8328 transitions. [2020-11-30 00:15:48,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:15:48,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 8328 transitions. [2020-11-30 00:15:48,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-30 00:15:48,290 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:48,290 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:15:48,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 00:15:48,291 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:48,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:48,291 INFO L82 PathProgramCache]: Analyzing trace with hash -156942098, now seen corresponding path program 1 times [2020-11-30 00:15:48,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:48,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127957752] [2020-11-30 00:15:48,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:48,483 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 00:15:48,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127957752] [2020-11-30 00:15:48,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:48,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:48,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553157858] [2020-11-30 00:15:48,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:15:48,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:48,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:15:48,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:15:48,485 INFO L87 Difference]: Start difference. First operand 2182 states and 8328 transitions. Second operand 5 states. [2020-11-30 00:15:48,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:48,595 INFO L93 Difference]: Finished difference Result 2476 states and 9168 transitions. [2020-11-30 00:15:48,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:15:48,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-30 00:15:48,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:48,626 INFO L225 Difference]: With dead ends: 2476 [2020-11-30 00:15:48,626 INFO L226 Difference]: Without dead ends: 2126 [2020-11-30 00:15:48,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:15:48,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2020-11-30 00:15:48,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 2126. [2020-11-30 00:15:48,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2126 states. [2020-11-30 00:15:48,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 8080 transitions. [2020-11-30 00:15:48,753 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 8080 transitions. Word has length 13 [2020-11-30 00:15:48,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:48,753 INFO L481 AbstractCegarLoop]: Abstraction has 2126 states and 8080 transitions. [2020-11-30 00:15:48,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:15:48,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 8080 transitions. [2020-11-30 00:15:48,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-30 00:15:48,757 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:48,757 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:15:48,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 00:15:48,758 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:48,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:48,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1067393042, now seen corresponding path program 1 times [2020-11-30 00:15:48,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:48,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312643650] [2020-11-30 00:15:48,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:48,979 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 00:15:48,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312643650] [2020-11-30 00:15:48,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:48,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:48,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897511499] [2020-11-30 00:15:48,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:15:48,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:48,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:15:48,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:15:48,982 INFO L87 Difference]: Start difference. First operand 2126 states and 8080 transitions. Second operand 5 states. [2020-11-30 00:15:49,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:49,178 INFO L93 Difference]: Finished difference Result 2366 states and 8732 transitions. [2020-11-30 00:15:49,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:15:49,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-30 00:15:49,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:49,208 INFO L225 Difference]: With dead ends: 2366 [2020-11-30 00:15:49,209 INFO L226 Difference]: Without dead ends: 2046 [2020-11-30 00:15:49,209 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:15:49,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2020-11-30 00:15:49,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 2046. [2020-11-30 00:15:49,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2046 states. [2020-11-30 00:15:49,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 7716 transitions. [2020-11-30 00:15:49,343 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 7716 transitions. Word has length 13 [2020-11-30 00:15:49,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:49,344 INFO L481 AbstractCegarLoop]: Abstraction has 2046 states and 7716 transitions. [2020-11-30 00:15:49,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:15:49,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 7716 transitions. [2020-11-30 00:15:49,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 00:15:49,348 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:49,348 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:15:49,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 00:15:49,350 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:49,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:49,352 INFO L82 PathProgramCache]: Analyzing trace with hash -570272720, now seen corresponding path program 1 times [2020-11-30 00:15:49,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:49,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358741848] [2020-11-30 00:15:49,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:49,512 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 00:15:49,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358741848] [2020-11-30 00:15:49,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:49,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:49,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847854296] [2020-11-30 00:15:49,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:15:49,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:49,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:15:49,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:15:49,514 INFO L87 Difference]: Start difference. First operand 2046 states and 7716 transitions. Second operand 5 states. [2020-11-30 00:15:49,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:49,636 INFO L93 Difference]: Finished difference Result 2278 states and 8362 transitions. [2020-11-30 00:15:49,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:15:49,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-30 00:15:49,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:49,661 INFO L225 Difference]: With dead ends: 2278 [2020-11-30 00:15:49,661 INFO L226 Difference]: Without dead ends: 1998 [2020-11-30 00:15:49,663 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:15:49,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2020-11-30 00:15:49,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1998. [2020-11-30 00:15:49,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2020-11-30 00:15:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7504 transitions. [2020-11-30 00:15:49,766 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7504 transitions. Word has length 14 [2020-11-30 00:15:49,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:49,766 INFO L481 AbstractCegarLoop]: Abstraction has 1998 states and 7504 transitions. [2020-11-30 00:15:49,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:15:49,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7504 transitions. [2020-11-30 00:15:49,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-30 00:15:49,771 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:49,771 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:15:49,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 00:15:49,771 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:49,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:49,772 INFO L82 PathProgramCache]: Analyzing trace with hash 440106962, now seen corresponding path program 1 times [2020-11-30 00:15:49,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:49,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869000782] [2020-11-30 00:15:49,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:49,919 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 00:15:49,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869000782] [2020-11-30 00:15:49,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:49,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:15:49,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875098757] [2020-11-30 00:15:49,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:15:49,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:49,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:15:49,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:15:49,921 INFO L87 Difference]: Start difference. First operand 1998 states and 7504 transitions. Second operand 6 states. [2020-11-30 00:15:50,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:50,123 INFO L93 Difference]: Finished difference Result 2166 states and 7916 transitions. [2020-11-30 00:15:50,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:15:50,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-11-30 00:15:50,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:50,161 INFO L225 Difference]: With dead ends: 2166 [2020-11-30 00:15:50,161 INFO L226 Difference]: Without dead ends: 1910 [2020-11-30 00:15:50,162 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:15:50,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2020-11-30 00:15:50,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1910. [2020-11-30 00:15:50,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2020-11-30 00:15:50,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 7120 transitions. [2020-11-30 00:15:50,253 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 7120 transitions. Word has length 15 [2020-11-30 00:15:50,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:50,253 INFO L481 AbstractCegarLoop]: Abstraction has 1910 states and 7120 transitions. [2020-11-30 00:15:50,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:15:50,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 7120 transitions. [2020-11-30 00:15:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-30 00:15:50,257 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:50,257 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:15:50,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 00:15:50,258 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:50,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:50,258 INFO L82 PathProgramCache]: Analyzing trace with hash -498850754, now seen corresponding path program 1 times [2020-11-30 00:15:50,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:50,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401495949] [2020-11-30 00:15:50,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:50,392 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 00:15:50,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401495949] [2020-11-30 00:15:50,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:50,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:15:50,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17277337] [2020-11-30 00:15:50,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:15:50,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:50,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:15:50,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:15:50,395 INFO L87 Difference]: Start difference. First operand 1910 states and 7120 transitions. Second operand 6 states. [2020-11-30 00:15:50,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:50,584 INFO L93 Difference]: Finished difference Result 2136 states and 7798 transitions. [2020-11-30 00:15:50,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:15:50,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-11-30 00:15:50,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:50,614 INFO L225 Difference]: With dead ends: 2136 [2020-11-30 00:15:50,615 INFO L226 Difference]: Without dead ends: 1926 [2020-11-30 00:15:50,615 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:15:50,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2020-11-30 00:15:50,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1926. [2020-11-30 00:15:50,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1926 states. [2020-11-30 00:15:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 7176 transitions. [2020-11-30 00:15:50,712 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 7176 transitions. Word has length 15 [2020-11-30 00:15:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:50,712 INFO L481 AbstractCegarLoop]: Abstraction has 1926 states and 7176 transitions. [2020-11-30 00:15:50,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:15:50,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 7176 transitions. [2020-11-30 00:15:50,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-30 00:15:50,717 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:50,717 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:15:50,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 00:15:50,718 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:50,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:50,718 INFO L82 PathProgramCache]: Analyzing trace with hash -503924834, now seen corresponding path program 2 times [2020-11-30 00:15:50,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:50,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054791447] [2020-11-30 00:15:50,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:50,900 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 00:15:50,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054791447] [2020-11-30 00:15:50,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:50,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:15:50,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863044875] [2020-11-30 00:15:50,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:15:50,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:50,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:15:50,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:15:50,902 INFO L87 Difference]: Start difference. First operand 1926 states and 7176 transitions. Second operand 6 states. [2020-11-30 00:15:51,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:51,141 INFO L93 Difference]: Finished difference Result 2396 states and 8834 transitions. [2020-11-30 00:15:51,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:15:51,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-11-30 00:15:51,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:51,155 INFO L225 Difference]: With dead ends: 2396 [2020-11-30 00:15:51,155 INFO L226 Difference]: Without dead ends: 2130 [2020-11-30 00:15:51,161 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:15:51,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2020-11-30 00:15:51,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 2114. [2020-11-30 00:15:51,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2020-11-30 00:15:51,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 7880 transitions. [2020-11-30 00:15:51,299 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 7880 transitions. Word has length 15 [2020-11-30 00:15:51,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:51,299 INFO L481 AbstractCegarLoop]: Abstraction has 2114 states and 7880 transitions. [2020-11-30 00:15:51,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:15:51,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 7880 transitions. [2020-11-30 00:15:51,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-30 00:15:51,308 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:51,308 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:15:51,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 00:15:51,309 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:51,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:51,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1722380032, now seen corresponding path program 1 times [2020-11-30 00:15:51,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:51,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884818433] [2020-11-30 00:15:51,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:51,445 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 00:15:51,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884818433] [2020-11-30 00:15:51,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:51,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:15:51,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87433062] [2020-11-30 00:15:51,446 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:15:51,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:51,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:15:51,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:15:51,447 INFO L87 Difference]: Start difference. First operand 2114 states and 7880 transitions. Second operand 6 states. [2020-11-30 00:15:51,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:51,650 INFO L93 Difference]: Finished difference Result 2406 states and 8792 transitions. [2020-11-30 00:15:51,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:15:51,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-11-30 00:15:51,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:51,665 INFO L225 Difference]: With dead ends: 2406 [2020-11-30 00:15:51,665 INFO L226 Difference]: Without dead ends: 2210 [2020-11-30 00:15:51,666 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:15:51,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2020-11-30 00:15:51,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 2058. [2020-11-30 00:15:51,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2020-11-30 00:15:51,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 7584 transitions. [2020-11-30 00:15:51,777 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 7584 transitions. Word has length 16 [2020-11-30 00:15:51,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:51,778 INFO L481 AbstractCegarLoop]: Abstraction has 2058 states and 7584 transitions. [2020-11-30 00:15:51,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:15:51,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 7584 transitions. [2020-11-30 00:15:51,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-30 00:15:51,785 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:51,785 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:15:51,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 00:15:51,786 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:51,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:51,786 INFO L82 PathProgramCache]: Analyzing trace with hash 2033462547, now seen corresponding path program 1 times [2020-11-30 00:15:51,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:51,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694056402] [2020-11-30 00:15:51,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:51,870 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 00:15:51,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694056402] [2020-11-30 00:15:51,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:51,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:51,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362850064] [2020-11-30 00:15:51,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:15:51,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:51,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:15:51,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:15:51,872 INFO L87 Difference]: Start difference. First operand 2058 states and 7584 transitions. Second operand 4 states. [2020-11-30 00:15:51,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:51,944 INFO L93 Difference]: Finished difference Result 3082 states and 10968 transitions. [2020-11-30 00:15:51,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:15:51,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-11-30 00:15:51,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:51,961 INFO L225 Difference]: With dead ends: 3082 [2020-11-30 00:15:51,961 INFO L226 Difference]: Without dead ends: 2218 [2020-11-30 00:15:51,962 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:15:51,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2020-11-30 00:15:52,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2026. [2020-11-30 00:15:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2026 states. [2020-11-30 00:15:52,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 7120 transitions. [2020-11-30 00:15:52,066 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 7120 transitions. Word has length 17 [2020-11-30 00:15:52,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:52,067 INFO L481 AbstractCegarLoop]: Abstraction has 2026 states and 7120 transitions. [2020-11-30 00:15:52,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:15:52,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 7120 transitions. [2020-11-30 00:15:52,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-30 00:15:52,073 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:52,073 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:15:52,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 00:15:52,074 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:52,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:52,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1817459975, now seen corresponding path program 1 times [2020-11-30 00:15:52,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:52,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70427136] [2020-11-30 00:15:52,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:52,201 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 00:15:52,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70427136] [2020-11-30 00:15:52,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:52,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:52,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037948565] [2020-11-30 00:15:52,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:15:52,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:52,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:15:52,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:15:52,203 INFO L87 Difference]: Start difference. First operand 2026 states and 7120 transitions. Second operand 4 states. [2020-11-30 00:15:52,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:52,289 INFO L93 Difference]: Finished difference Result 2110 states and 6745 transitions. [2020-11-30 00:15:52,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:15:52,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-11-30 00:15:52,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:52,299 INFO L225 Difference]: With dead ends: 2110 [2020-11-30 00:15:52,299 INFO L226 Difference]: Without dead ends: 1614 [2020-11-30 00:15:52,300 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:15:52,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2020-11-30 00:15:52,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1614. [2020-11-30 00:15:52,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1614 states. [2020-11-30 00:15:52,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 5150 transitions. [2020-11-30 00:15:52,374 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 5150 transitions. Word has length 17 [2020-11-30 00:15:52,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:52,375 INFO L481 AbstractCegarLoop]: Abstraction has 1614 states and 5150 transitions. [2020-11-30 00:15:52,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:15:52,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 5150 transitions. [2020-11-30 00:15:52,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 00:15:52,380 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:52,380 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:15:52,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 00:15:52,381 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:52,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:52,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1047833445, now seen corresponding path program 1 times [2020-11-30 00:15:52,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:52,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516662587] [2020-11-30 00:15:52,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:52,493 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 00:15:52,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516662587] [2020-11-30 00:15:52,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:52,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:15:52,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392273666] [2020-11-30 00:15:52,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:15:52,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:52,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:15:52,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:15:52,495 INFO L87 Difference]: Start difference. First operand 1614 states and 5150 transitions. Second operand 5 states. [2020-11-30 00:15:52,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:52,582 INFO L93 Difference]: Finished difference Result 1369 states and 3958 transitions. [2020-11-30 00:15:52,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:15:52,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-11-30 00:15:52,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:52,588 INFO L225 Difference]: With dead ends: 1369 [2020-11-30 00:15:52,588 INFO L226 Difference]: Without dead ends: 1044 [2020-11-30 00:15:52,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:15:52,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2020-11-30 00:15:52,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 1044. [2020-11-30 00:15:52,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1044 states. [2020-11-30 00:15:52,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 2960 transitions. [2020-11-30 00:15:52,630 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 2960 transitions. Word has length 18 [2020-11-30 00:15:52,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:52,631 INFO L481 AbstractCegarLoop]: Abstraction has 1044 states and 2960 transitions. [2020-11-30 00:15:52,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:15:52,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 2960 transitions. [2020-11-30 00:15:52,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-30 00:15:52,635 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:52,635 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:15:52,635 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 00:15:52,636 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:52,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:52,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1687389071, now seen corresponding path program 1 times [2020-11-30 00:15:52,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:52,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719951885] [2020-11-30 00:15:52,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:52,723 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 00:15:52,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719951885] [2020-11-30 00:15:52,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:52,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:15:52,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939364334] [2020-11-30 00:15:52,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:15:52,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:52,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:15:52,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:15:52,725 INFO L87 Difference]: Start difference. First operand 1044 states and 2960 transitions. Second operand 4 states. [2020-11-30 00:15:52,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:52,774 INFO L93 Difference]: Finished difference Result 1527 states and 4141 transitions. [2020-11-30 00:15:52,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:15:52,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-11-30 00:15:52,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:52,779 INFO L225 Difference]: With dead ends: 1527 [2020-11-30 00:15:52,779 INFO L226 Difference]: Without dead ends: 1064 [2020-11-30 00:15:52,780 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:15:52,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2020-11-30 00:15:52,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1016. [2020-11-30 00:15:52,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016 states. [2020-11-30 00:15:52,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 2733 transitions. [2020-11-30 00:15:52,822 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 2733 transitions. Word has length 20 [2020-11-30 00:15:52,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:52,822 INFO L481 AbstractCegarLoop]: Abstraction has 1016 states and 2733 transitions. [2020-11-30 00:15:52,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:15:52,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 2733 transitions. [2020-11-30 00:15:52,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-30 00:15:52,826 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:52,826 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:15:52,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-30 00:15:52,827 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:52,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:52,827 INFO L82 PathProgramCache]: Analyzing trace with hash 219006172, now seen corresponding path program 1 times [2020-11-30 00:15:52,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:52,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774151179] [2020-11-30 00:15:52,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:52,936 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 00:15:52,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774151179] [2020-11-30 00:15:52,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:52,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:15:52,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022294664] [2020-11-30 00:15:52,937 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:15:52,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:52,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:15:52,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:15:52,938 INFO L87 Difference]: Start difference. First operand 1016 states and 2733 transitions. Second operand 6 states. [2020-11-30 00:15:53,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:53,037 INFO L93 Difference]: Finished difference Result 858 states and 2246 transitions. [2020-11-30 00:15:53,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:15:53,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-11-30 00:15:53,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:53,041 INFO L225 Difference]: With dead ends: 858 [2020-11-30 00:15:53,041 INFO L226 Difference]: Without dead ends: 690 [2020-11-30 00:15:53,042 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:15:53,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2020-11-30 00:15:53,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 630. [2020-11-30 00:15:53,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2020-11-30 00:15:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 1625 transitions. [2020-11-30 00:15:53,070 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 1625 transitions. Word has length 20 [2020-11-30 00:15:53,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:53,071 INFO L481 AbstractCegarLoop]: Abstraction has 630 states and 1625 transitions. [2020-11-30 00:15:53,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:15:53,071 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 1625 transitions. [2020-11-30 00:15:53,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 00:15:53,075 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:53,075 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:15:53,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-30 00:15:53,075 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:53,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:53,076 INFO L82 PathProgramCache]: Analyzing trace with hash 961159876, now seen corresponding path program 1 times [2020-11-30 00:15:53,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:53,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157795710] [2020-11-30 00:15:53,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:53,185 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 00:15:53,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157795710] [2020-11-30 00:15:53,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:53,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:15:53,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11732436] [2020-11-30 00:15:53,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:15:53,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:53,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:15:53,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:15:53,187 INFO L87 Difference]: Start difference. First operand 630 states and 1625 transitions. Second operand 5 states. [2020-11-30 00:15:53,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:53,247 INFO L93 Difference]: Finished difference Result 848 states and 2123 transitions. [2020-11-30 00:15:53,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:15:53,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-11-30 00:15:53,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:53,249 INFO L225 Difference]: With dead ends: 848 [2020-11-30 00:15:53,250 INFO L226 Difference]: Without dead ends: 460 [2020-11-30 00:15:53,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:15:53,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2020-11-30 00:15:53,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 454. [2020-11-30 00:15:53,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2020-11-30 00:15:53,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1052 transitions. [2020-11-30 00:15:53,283 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1052 transitions. Word has length 23 [2020-11-30 00:15:53,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:53,283 INFO L481 AbstractCegarLoop]: Abstraction has 454 states and 1052 transitions. [2020-11-30 00:15:53,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:15:53,283 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1052 transitions. [2020-11-30 00:15:53,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 00:15:53,286 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:53,286 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:15:53,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-30 00:15:53,286 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:53,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:53,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1284568559, now seen corresponding path program 1 times [2020-11-30 00:15:53,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:53,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976664912] [2020-11-30 00:15:53,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:53,506 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 00:15:53,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976664912] [2020-11-30 00:15:53,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:53,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:15:53,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174931960] [2020-11-30 00:15:53,510 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:15:53,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:53,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:15:53,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:15:53,511 INFO L87 Difference]: Start difference. First operand 454 states and 1052 transitions. Second operand 7 states. [2020-11-30 00:15:53,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:53,735 INFO L93 Difference]: Finished difference Result 562 states and 1263 transitions. [2020-11-30 00:15:53,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:15:53,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-11-30 00:15:53,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:53,737 INFO L225 Difference]: With dead ends: 562 [2020-11-30 00:15:53,738 INFO L226 Difference]: Without dead ends: 312 [2020-11-30 00:15:53,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:15:53,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2020-11-30 00:15:53,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 306. [2020-11-30 00:15:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2020-11-30 00:15:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 665 transitions. [2020-11-30 00:15:53,753 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 665 transitions. Word has length 23 [2020-11-30 00:15:53,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:53,753 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 665 transitions. [2020-11-30 00:15:53,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:15:53,754 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 665 transitions. [2020-11-30 00:15:53,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 00:15:53,755 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:53,756 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:15:53,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-30 00:15:53,756 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:53,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:53,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1492688256, now seen corresponding path program 1 times [2020-11-30 00:15:53,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:53,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860762280] [2020-11-30 00:15:53,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:15:53,909 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 00:15:53,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860762280] [2020-11-30 00:15:53,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:15:53,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 00:15:53,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072787247] [2020-11-30 00:15:53,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:15:53,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:15:53,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:15:53,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:15:53,911 INFO L87 Difference]: Start difference. First operand 306 states and 665 transitions. Second operand 7 states. [2020-11-30 00:15:54,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:15:54,033 INFO L93 Difference]: Finished difference Result 277 states and 608 transitions. [2020-11-30 00:15:54,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:15:54,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-11-30 00:15:54,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:15:54,035 INFO L225 Difference]: With dead ends: 277 [2020-11-30 00:15:54,035 INFO L226 Difference]: Without dead ends: 64 [2020-11-30 00:15:54,035 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:15:54,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-30 00:15:54,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-11-30 00:15:54,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-30 00:15:54,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 122 transitions. [2020-11-30 00:15:54,038 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 122 transitions. Word has length 23 [2020-11-30 00:15:54,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:15:54,039 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 122 transitions. [2020-11-30 00:15:54,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:15:54,039 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 122 transitions. [2020-11-30 00:15:54,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-30 00:15:54,039 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:15:54,039 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:15:54,039 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-30 00:15:54,040 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:15:54,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:15:54,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1849601120, now seen corresponding path program 1 times [2020-11-30 00:15:54,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:15:54,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076900366] [2020-11-30 00:15:54,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:15:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:15:54,129 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:15:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:15:54,188 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:15:54,255 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:15:54,256 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 00:15:54,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-30 00:15:54,282 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,282 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [795] [2020-11-30 00:15:54,284 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,285 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,285 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,285 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,285 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,285 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,286 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,286 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,286 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,286 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,287 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,287 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,287 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,287 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,288 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,288 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,288 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,288 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,288 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,289 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,290 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,290 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,290 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,290 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,291 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,291 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,291 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,291 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,291 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,292 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,292 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,292 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,293 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,293 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,293 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,293 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,293 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,294 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,294 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,294 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,294 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,295 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,295 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,295 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,295 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,296 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,296 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,296 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,296 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,296 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,297 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,297 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,297 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,297 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,297 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,298 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,298 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,298 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 12:15:54 BasicIcfg [2020-11-30 00:15:54,436 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 00:15:54,437 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:15:54,437 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:15:54,438 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:15:54,438 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:15:37" (3/4) ... [2020-11-30 00:15:54,441 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 00:15:54,459 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,460 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [795] [2020-11-30 00:15:54,461 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,461 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,462 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,462 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,462 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,462 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,462 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,462 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,463 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,463 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,463 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,463 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,463 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,464 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,464 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,464 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,464 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,464 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,464 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,465 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,465 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,465 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,465 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,466 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,466 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,466 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,466 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,466 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,466 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,467 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,467 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,467 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,467 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,467 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,468 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,468 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,468 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,469 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,469 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,469 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,469 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,469 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,469 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,470 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,470 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,470 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,470 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,470 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,471 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,471 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,471 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:15:54,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:15:54,629 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8310da19-7d70-4b9e-81be-983024de89ba/bin/uautomizer/witness.graphml [2020-11-30 00:15:54,629 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:15:54,630 INFO L168 Benchmark]: Toolchain (without parser) took 21355.36 ms. Allocated memory was 94.4 MB in the beginning and 354.4 MB in the end (delta: 260.0 MB). Free memory was 58.6 MB in the beginning and 167.2 MB in the end (delta: -108.6 MB). Peak memory consumption was 152.5 MB. Max. memory is 16.1 GB. [2020-11-30 00:15:54,631 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 94.4 MB. Free memory was 68.6 MB in the beginning and 68.6 MB in the end (delta: 28.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:15:54,631 INFO L168 Benchmark]: CACSL2BoogieTranslator took 857.18 ms. Allocated memory is still 94.4 MB. Free memory was 58.4 MB in the beginning and 46.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 00:15:54,632 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.95 ms. Allocated memory is still 94.4 MB. Free memory was 46.0 MB in the beginning and 43.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:15:54,632 INFO L168 Benchmark]: Boogie Preprocessor took 51.00 ms. Allocated memory is still 94.4 MB. Free memory was 43.5 MB in the beginning and 41.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:15:54,633 INFO L168 Benchmark]: RCFGBuilder took 3465.77 ms. Allocated memory was 94.4 MB in the beginning and 144.7 MB in the end (delta: 50.3 MB). Free memory was 41.0 MB in the beginning and 88.8 MB in the end (delta: -47.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.1 GB. [2020-11-30 00:15:54,633 INFO L168 Benchmark]: TraceAbstraction took 16699.93 ms. Allocated memory was 144.7 MB in the beginning and 354.4 MB in the end (delta: 209.7 MB). Free memory was 88.8 MB in the beginning and 187.1 MB in the end (delta: -98.3 MB). Peak memory consumption was 110.3 MB. Max. memory is 16.1 GB. [2020-11-30 00:15:54,634 INFO L168 Benchmark]: Witness Printer took 191.82 ms. Allocated memory is still 354.4 MB. Free memory was 187.1 MB in the beginning and 167.2 MB in the end (delta: 19.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-30 00:15:54,638 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.31 ms. Allocated memory is still 94.4 MB. Free memory was 68.6 MB in the beginning and 68.6 MB in the end (delta: 28.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 857.18 ms. Allocated memory is still 94.4 MB. Free memory was 58.4 MB in the beginning and 46.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 79.95 ms. Allocated memory is still 94.4 MB. Free memory was 46.0 MB in the beginning and 43.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 51.00 ms. Allocated memory is still 94.4 MB. Free memory was 43.5 MB in the beginning and 41.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3465.77 ms. Allocated memory was 94.4 MB in the beginning and 144.7 MB in the end (delta: 50.3 MB). Free memory was 41.0 MB in the beginning and 88.8 MB in the end (delta: -47.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 16699.93 ms. Allocated memory was 144.7 MB in the beginning and 354.4 MB in the end (delta: 209.7 MB). Free memory was 88.8 MB in the beginning and 187.1 MB in the end (delta: -98.3 MB). Peak memory consumption was 110.3 MB. Max. memory is 16.1 GB. * Witness Printer took 191.82 ms. Allocated memory is still 354.4 MB. Free memory was 187.1 MB in the beginning and 167.2 MB in the end (delta: 19.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1738 VarBasedMoverChecksPositive, 78 VarBasedMoverChecksNegative, 31 SemBasedMoverChecksPositive, 47 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 196 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.7s, 126 PlacesBefore, 45 PlacesAfterwards, 116 TransitionsBefore, 33 TransitionsAfterwards, 2622 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 98 TotalNumberOfCompositions, 6442 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1533; [L835] FCALL, FORK 0 pthread_create(&t1533, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1534; [L837] FCALL, FORK 0 pthread_create(&t1534, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1535; [L839] FCALL, FORK 0 pthread_create(&t1535, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1536; [L841] FCALL, FORK 0 pthread_create(&t1536, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L761] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L864] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix057_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.3s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.0s, HoareTripleCheckerStatistics: 650 SDtfs, 838 SDslu, 1231 SDs, 0 SdLazy, 463 SolverSat, 142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3082occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 480 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 309 NumberOfCodeBlocks, 309 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 266 ConstructedInterpolants, 0 QuantifiedInterpolants, 24021 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...