./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix047_rmo.oepc.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_92511188-934c-444e-8415-ff59096871ed/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_92511188-934c-444e-8415-ff59096871ed/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_92511188-934c-444e-8415-ff59096871ed/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_92511188-934c-444e-8415-ff59096871ed/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix047_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_92511188-934c-444e-8415-ff59096871ed/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_92511188-934c-444e-8415-ff59096871ed/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 6fc3896cd65a30b6fe415b797cf658b4abd37a9c .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-28 03:13:31,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:13:31,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:13:31,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:13:31,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:13:31,230 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:13:31,232 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:13:31,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:13:31,237 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:13:31,239 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:13:31,240 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:13:31,242 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:13:31,243 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:13:31,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:13:31,246 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:13:31,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:13:31,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:13:31,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:13:31,253 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:13:31,256 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:13:31,259 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:13:31,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:13:31,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:13:31,266 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:13:31,270 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:13:31,270 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:13:31,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:13:31,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:13:31,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:13:31,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:13:31,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:13:31,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:13:31,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:13:31,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:13:31,286 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:13:31,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:13:31,288 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:13:31,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:13:31,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:13:31,290 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:13:31,291 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:13:31,295 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_92511188-934c-444e-8415-ff59096871ed/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 03:13:31,344 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:13:31,352 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:13:31,355 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:13:31,355 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:13:31,356 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:13:31,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:13:31,356 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:13:31,357 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:13:31,357 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:13:31,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:13:31,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 03:13:31,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 03:13:31,359 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 03:13:31,360 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:13:31,360 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:13:31,360 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:13:31,360 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 03:13:31,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:13:31,361 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:13:31,361 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 03:13:31,361 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 03:13:31,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 03:13:31,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:13:31,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 03:13:31,363 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 03:13:31,363 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:13:31,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 03:13:31,363 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 03:13:31,364 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:13:31,364 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_92511188-934c-444e-8415-ff59096871ed/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_92511188-934c-444e-8415-ff59096871ed/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 -> 6fc3896cd65a30b6fe415b797cf658b4abd37a9c [2020-11-28 03:13:31,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:13:31,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:13:31,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:13:31,762 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:13:31,763 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:13:31,765 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_92511188-934c-444e-8415-ff59096871ed/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix047_rmo.oepc.i [2020-11-28 03:13:31,862 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_92511188-934c-444e-8415-ff59096871ed/bin/uautomizer/data/ccc54976b/6b1e93d5cd67457783df31113a3e13f8/FLAGc33c9b55d [2020-11-28 03:13:32,651 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:13:32,651 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_92511188-934c-444e-8415-ff59096871ed/sv-benchmarks/c/pthread-wmm/mix047_rmo.oepc.i [2020-11-28 03:13:32,700 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_92511188-934c-444e-8415-ff59096871ed/bin/uautomizer/data/ccc54976b/6b1e93d5cd67457783df31113a3e13f8/FLAGc33c9b55d [2020-11-28 03:13:32,883 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_92511188-934c-444e-8415-ff59096871ed/bin/uautomizer/data/ccc54976b/6b1e93d5cd67457783df31113a3e13f8 [2020-11-28 03:13:32,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:13:32,888 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:13:32,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:13:32,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:13:32,895 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:13:32,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:13:32" (1/1) ... [2020-11-28 03:13:32,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5046e0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:32, skipping insertion in model container [2020-11-28 03:13:32,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:13:32" (1/1) ... [2020-11-28 03:13:32,908 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:13:32,972 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:13:33,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:13:33,680 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:13:33,801 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:13:33,929 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:13:33,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:33 WrapperNode [2020-11-28 03:13:33,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:13:33,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:13:33,935 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:13:33,936 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:13:33,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:33" (1/1) ... [2020-11-28 03:13:33,979 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:33" (1/1) ... [2020-11-28 03:13:34,011 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:13:34,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:13:34,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:13:34,012 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:13:34,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:33" (1/1) ... [2020-11-28 03:13:34,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:33" (1/1) ... [2020-11-28 03:13:34,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:33" (1/1) ... [2020-11-28 03:13:34,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:33" (1/1) ... [2020-11-28 03:13:34,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:33" (1/1) ... [2020-11-28 03:13:34,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:33" (1/1) ... [2020-11-28 03:13:34,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:33" (1/1) ... [2020-11-28 03:13:34,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:13:34,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:13:34,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:13:34,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:13:34,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92511188-934c-444e-8415-ff59096871ed/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-28 03:13:34,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 03:13:34,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-28 03:13:34,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:13:34,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 03:13:34,173 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-28 03:13:34,173 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-28 03:13:34,173 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-28 03:13:34,173 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-28 03:13:34,174 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-28 03:13:34,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-28 03:13:34,174 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-28 03:13:34,175 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-28 03:13:34,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:13:34,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-28 03:13:34,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:13:34,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:13:34,177 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-28 03:13:37,528 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:13:37,528 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-28 03:13:37,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:13:37 BoogieIcfgContainer [2020-11-28 03:13:37,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:13:37,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 03:13:37,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 03:13:37,540 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 03:13:37,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:13:32" (1/3) ... [2020-11-28 03:13:37,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2afccdac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:13:37, skipping insertion in model container [2020-11-28 03:13:37,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:33" (2/3) ... [2020-11-28 03:13:37,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2afccdac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:13:37, skipping insertion in model container [2020-11-28 03:13:37,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:13:37" (3/3) ... [2020-11-28 03:13:37,544 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_rmo.oepc.i [2020-11-28 03:13:37,558 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-28 03:13:37,558 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 03:13:37,564 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-28 03:13:37,565 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-28 03:13:37,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,632 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,632 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,633 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,634 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,640 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,640 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,640 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,644 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,645 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,646 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,649 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,650 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,650 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,650 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,650 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,651 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,651 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,651 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,651 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,652 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,652 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,652 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,653 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,653 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,653 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,653 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,653 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,655 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,655 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,655 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,656 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,657 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,657 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,657 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,659 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,659 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,659 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,659 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,660 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,661 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,670 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,674 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,676 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,676 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,686 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,686 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,686 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,686 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,687 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,689 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,690 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,690 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,690 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,690 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,692 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,692 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,692 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,692 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,693 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,693 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,693 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,693 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,695 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,695 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,695 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,695 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,695 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,700 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,700 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,700 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,700 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,702 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,702 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,705 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,705 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,706 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,706 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,706 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,706 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:13:37,709 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-28 03:13:37,724 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-28 03:13:37,753 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 03:13:37,753 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 03:13:37,754 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 03:13:37,754 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:13:37,754 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:13:37,754 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 03:13:37,755 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:13:37,755 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 03:13:37,775 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-28 03:13:37,778 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 122 transitions, 264 flow [2020-11-28 03:13:37,782 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 122 transitions, 264 flow [2020-11-28 03:13:37,784 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 132 places, 122 transitions, 264 flow [2020-11-28 03:13:37,881 INFO L129 PetriNetUnfolder]: 3/118 cut-off events. [2020-11-28 03:13:37,881 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-28 03:13:37,892 INFO L80 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 118 events. 3/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 96 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2020-11-28 03:13:37,902 INFO L116 LiptonReduction]: Number of co-enabled transitions 3124 [2020-11-28 03:13:38,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:13:38,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:13:38,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:13:38,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:13:38,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:38,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:38,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:13:38,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:13:38,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:13:38,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:13:38,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:13:38,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:13:38,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:13:38,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:13:38,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:13:38,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:13:38,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:13:38,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:13:38,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:38,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:38,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:38,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:38,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:38,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:38,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:38,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:38,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:38,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:38,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:38,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:38,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:38,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:38,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:38,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:38,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:38,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:38,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:38,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:38,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:38,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:38,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:38,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:38,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:38,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:38,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:38,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:38,671 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:38,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:38,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:38,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:38,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:38,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:38,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:13:38,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:13:38,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:13:38,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:13:38,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:13:38,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:13:38,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:13:38,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:13:38,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:13:38,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:13:38,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:13:38,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:13:38,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:13:38,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:13:38,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:13:38,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:13:38,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:38,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:38,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:38,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:38,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:38,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:38,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:38,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:38,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:38,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:38,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:38,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:38,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:38,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:38,996 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:38,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:39,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:39,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:39,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:39,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:39,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:39,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:39,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:39,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:39,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:39,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:39,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:39,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:39,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:39,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:39,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:39,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:39,664 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-11-28 03:13:39,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:39,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:39,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:39,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:39,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:39,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:39,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:39,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:39,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:39,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:39,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:39,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:39,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:39,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:39,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:39,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:39,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:39,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:39,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:39,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:39,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:39,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:39,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:39,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:39,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:39,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:39,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:39,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:39,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:39,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:39,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:39,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:40,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:40,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:40,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:40,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:40,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:40,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:40,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:40,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:40,228 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:40,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:40,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:40,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:40,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:40,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:40,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:40,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:40,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 03:13:40,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:40,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:13:40,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:13:40,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-28 03:13:40,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:13:40,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-28 03:13:40,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:13:40,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 03:13:40,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:41,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:13:41,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:13:41,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-28 03:13:41,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:13:41,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-28 03:13:41,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:13:41,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 03:13:41,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:41,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 03:13:41,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:41,405 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2020-11-28 03:13:41,995 WARN L193 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-28 03:13:42,153 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-28 03:13:42,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 03:13:42,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:42,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 03:13:42,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:42,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 03:13:42,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:42,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:42,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:42,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:42,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:42,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:42,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:13:42,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:42,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:13:42,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:42,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:42,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:42,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:42,633 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:42,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:42,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:42,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:42,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:42,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:42,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:42,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:42,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:42,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:42,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:42,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:13:42,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:42,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:42,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:42,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:13:42,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:13:42,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:13:42,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:13:42,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:13:43,875 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-28 03:13:44,087 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-28 03:13:44,751 WARN L193 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-11-28 03:13:45,011 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-11-28 03:13:45,020 INFO L131 LiptonReduction]: Checked pairs total: 8823 [2020-11-28 03:13:45,021 INFO L133 LiptonReduction]: Total number of compositions: 105 [2020-11-28 03:13:45,028 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 34 transitions, 88 flow [2020-11-28 03:13:45,433 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4874 states. [2020-11-28 03:13:45,435 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states. [2020-11-28 03:13:45,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-28 03:13:45,441 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:45,441 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-28 03:13:45,442 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:45,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:45,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1250779, now seen corresponding path program 1 times [2020-11-28 03:13:45,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:45,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877493791] [2020-11-28 03:13:45,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:45,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:45,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877493791] [2020-11-28 03:13:45,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:45,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 03:13:45,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219240148] [2020-11-28 03:13:45,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:13:45,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:45,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:13:45,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:45,851 INFO L87 Difference]: Start difference. First operand 4874 states. Second operand 3 states. [2020-11-28 03:13:46,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:46,099 INFO L93 Difference]: Finished difference Result 4062 states and 16125 transitions. [2020-11-28 03:13:46,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:13:46,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-11-28 03:13:46,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:46,166 INFO L225 Difference]: With dead ends: 4062 [2020-11-28 03:13:46,166 INFO L226 Difference]: Without dead ends: 3312 [2020-11-28 03:13:46,167 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-28 03:13:46,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2020-11-28 03:13:46,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3312. [2020-11-28 03:13:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3312 states. [2020-11-28 03:13:46,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 12950 transitions. [2020-11-28 03:13:46,595 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 12950 transitions. Word has length 3 [2020-11-28 03:13:46,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:46,596 INFO L481 AbstractCegarLoop]: Abstraction has 3312 states and 12950 transitions. [2020-11-28 03:13:46,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:13:46,596 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 12950 transitions. [2020-11-28 03:13:46,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-28 03:13:46,603 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:46,603 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:46,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 03:13:46,604 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:46,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:46,609 INFO L82 PathProgramCache]: Analyzing trace with hash 991430295, now seen corresponding path program 1 times [2020-11-28 03:13:46,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:46,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123646623] [2020-11-28 03:13:46,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:46,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:46,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123646623] [2020-11-28 03:13:46,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:46,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 03:13:46,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637476939] [2020-11-28 03:13:46,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:13:46,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:46,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:13:46,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:46,788 INFO L87 Difference]: Start difference. First operand 3312 states and 12950 transitions. Second operand 3 states. [2020-11-28 03:13:46,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:46,852 INFO L93 Difference]: Finished difference Result 3252 states and 12672 transitions. [2020-11-28 03:13:46,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:13:46,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-28 03:13:46,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:46,894 INFO L225 Difference]: With dead ends: 3252 [2020-11-28 03:13:46,894 INFO L226 Difference]: Without dead ends: 3252 [2020-11-28 03:13:46,895 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-28 03:13:46,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3252 states. [2020-11-28 03:13:47,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3252 to 3252. [2020-11-28 03:13:47,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3252 states. [2020-11-28 03:13:47,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3252 states to 3252 states and 12672 transitions. [2020-11-28 03:13:47,094 INFO L78 Accepts]: Start accepts. Automaton has 3252 states and 12672 transitions. Word has length 11 [2020-11-28 03:13:47,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:47,096 INFO L481 AbstractCegarLoop]: Abstraction has 3252 states and 12672 transitions. [2020-11-28 03:13:47,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:13:47,096 INFO L276 IsEmpty]: Start isEmpty. Operand 3252 states and 12672 transitions. [2020-11-28 03:13:47,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-28 03:13:47,106 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:47,106 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:47,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 03:13:47,106 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:47,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:47,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1133438454, now seen corresponding path program 1 times [2020-11-28 03:13:47,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:47,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290486391] [2020-11-28 03:13:47,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:47,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:47,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290486391] [2020-11-28 03:13:47,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:47,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 03:13:47,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083293907] [2020-11-28 03:13:47,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:13:47,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:47,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:13:47,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:47,221 INFO L87 Difference]: Start difference. First operand 3252 states and 12672 transitions. Second operand 3 states. [2020-11-28 03:13:47,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:47,284 INFO L93 Difference]: Finished difference Result 3204 states and 12452 transitions. [2020-11-28 03:13:47,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:13:47,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-11-28 03:13:47,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:47,326 INFO L225 Difference]: With dead ends: 3204 [2020-11-28 03:13:47,326 INFO L226 Difference]: Without dead ends: 3204 [2020-11-28 03:13:47,328 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-28 03:13:47,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3204 states. [2020-11-28 03:13:47,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3204 to 3204. [2020-11-28 03:13:47,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3204 states. [2020-11-28 03:13:47,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3204 states to 3204 states and 12452 transitions. [2020-11-28 03:13:47,579 INFO L78 Accepts]: Start accepts. Automaton has 3204 states and 12452 transitions. Word has length 12 [2020-11-28 03:13:47,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:47,580 INFO L481 AbstractCegarLoop]: Abstraction has 3204 states and 12452 transitions. [2020-11-28 03:13:47,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:13:47,580 INFO L276 IsEmpty]: Start isEmpty. Operand 3204 states and 12452 transitions. [2020-11-28 03:13:47,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 03:13:47,583 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:47,583 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:47,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 03:13:47,583 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:47,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:47,585 INFO L82 PathProgramCache]: Analyzing trace with hash -933910452, now seen corresponding path program 1 times [2020-11-28 03:13:47,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:47,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411107056] [2020-11-28 03:13:47,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:47,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:47,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411107056] [2020-11-28 03:13:47,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:47,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:13:47,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452014531] [2020-11-28 03:13:47,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:13:47,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:47,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:13:47,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:47,695 INFO L87 Difference]: Start difference. First operand 3204 states and 12452 transitions. Second operand 3 states. [2020-11-28 03:13:47,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:47,775 INFO L93 Difference]: Finished difference Result 4674 states and 17563 transitions. [2020-11-28 03:13:47,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:13:47,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-11-28 03:13:47,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:47,840 INFO L225 Difference]: With dead ends: 4674 [2020-11-28 03:13:47,841 INFO L226 Difference]: Without dead ends: 3474 [2020-11-28 03:13:47,841 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-28 03:13:47,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3474 states. [2020-11-28 03:13:47,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3474 to 3114. [2020-11-28 03:13:47,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-11-28 03:13:48,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 11665 transitions. [2020-11-28 03:13:48,014 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 11665 transitions. Word has length 13 [2020-11-28 03:13:48,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:48,015 INFO L481 AbstractCegarLoop]: Abstraction has 3114 states and 11665 transitions. [2020-11-28 03:13:48,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:13:48,015 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 11665 transitions. [2020-11-28 03:13:48,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 03:13:48,018 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:48,018 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:48,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 03:13:48,019 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:48,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:48,020 INFO L82 PathProgramCache]: Analyzing trace with hash 776802787, now seen corresponding path program 1 times [2020-11-28 03:13:48,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:48,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897693912] [2020-11-28 03:13:48,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:48,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:48,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897693912] [2020-11-28 03:13:48,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:48,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 03:13:48,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880632125] [2020-11-28 03:13:48,156 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:13:48,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:48,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:13:48,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:48,157 INFO L87 Difference]: Start difference. First operand 3114 states and 11665 transitions. Second operand 3 states. [2020-11-28 03:13:48,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:48,208 INFO L93 Difference]: Finished difference Result 2930 states and 10871 transitions. [2020-11-28 03:13:48,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:13:48,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-11-28 03:13:48,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:48,228 INFO L225 Difference]: With dead ends: 2930 [2020-11-28 03:13:48,228 INFO L226 Difference]: Without dead ends: 2930 [2020-11-28 03:13:48,229 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-28 03:13:48,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-11-28 03:13:48,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2930. [2020-11-28 03:13:48,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2930 states. [2020-11-28 03:13:48,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2930 states to 2930 states and 10871 transitions. [2020-11-28 03:13:48,400 INFO L78 Accepts]: Start accepts. Automaton has 2930 states and 10871 transitions. Word has length 13 [2020-11-28 03:13:48,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:48,402 INFO L481 AbstractCegarLoop]: Abstraction has 2930 states and 10871 transitions. [2020-11-28 03:13:48,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:13:48,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2930 states and 10871 transitions. [2020-11-28 03:13:48,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-28 03:13:48,407 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:48,408 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:48,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 03:13:48,408 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:48,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:48,409 INFO L82 PathProgramCache]: Analyzing trace with hash -821826988, now seen corresponding path program 1 times [2020-11-28 03:13:48,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:48,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578126234] [2020-11-28 03:13:48,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:48,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:48,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578126234] [2020-11-28 03:13:48,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:48,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:13:48,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146047789] [2020-11-28 03:13:48,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:13:48,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:48,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:13:48,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:13:48,563 INFO L87 Difference]: Start difference. First operand 2930 states and 10871 transitions. Second operand 4 states. [2020-11-28 03:13:48,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:48,664 INFO L93 Difference]: Finished difference Result 2914 states and 9786 transitions. [2020-11-28 03:13:48,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:13:48,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-28 03:13:48,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:48,677 INFO L225 Difference]: With dead ends: 2914 [2020-11-28 03:13:48,677 INFO L226 Difference]: Without dead ends: 2164 [2020-11-28 03:13:48,678 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-28 03:13:48,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2020-11-28 03:13:48,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2164. [2020-11-28 03:13:48,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2164 states. [2020-11-28 03:13:48,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 2164 states and 7161 transitions. [2020-11-28 03:13:48,798 INFO L78 Accepts]: Start accepts. Automaton has 2164 states and 7161 transitions. Word has length 15 [2020-11-28 03:13:48,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:48,799 INFO L481 AbstractCegarLoop]: Abstraction has 2164 states and 7161 transitions. [2020-11-28 03:13:48,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:13:48,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 7161 transitions. [2020-11-28 03:13:48,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-28 03:13:48,805 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:48,806 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-28 03:13:48,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 03:13:48,806 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:48,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:48,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1442427692, now seen corresponding path program 1 times [2020-11-28 03:13:48,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:48,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159887512] [2020-11-28 03:13:48,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:48,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:48,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159887512] [2020-11-28 03:13:48,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:48,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:13:48,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286744371] [2020-11-28 03:13:48,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:13:48,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:48,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:13:48,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:48,890 INFO L87 Difference]: Start difference. First operand 2164 states and 7161 transitions. Second operand 3 states. [2020-11-28 03:13:48,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:48,948 INFO L93 Difference]: Finished difference Result 3229 states and 10392 transitions. [2020-11-28 03:13:48,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:13:48,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-11-28 03:13:48,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:48,960 INFO L225 Difference]: With dead ends: 3229 [2020-11-28 03:13:48,961 INFO L226 Difference]: Without dead ends: 2245 [2020-11-28 03:13:48,962 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-28 03:13:48,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2020-11-28 03:13:49,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2134. [2020-11-28 03:13:49,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2134 states. [2020-11-28 03:13:49,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 2134 states and 6763 transitions. [2020-11-28 03:13:49,064 INFO L78 Accepts]: Start accepts. Automaton has 2134 states and 6763 transitions. Word has length 18 [2020-11-28 03:13:49,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:49,065 INFO L481 AbstractCegarLoop]: Abstraction has 2134 states and 6763 transitions. [2020-11-28 03:13:49,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:13:49,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2134 states and 6763 transitions. [2020-11-28 03:13:49,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-28 03:13:49,070 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:49,070 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-28 03:13:49,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 03:13:49,071 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:49,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:49,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1529528496, now seen corresponding path program 1 times [2020-11-28 03:13:49,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:49,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176772074] [2020-11-28 03:13:49,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:49,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:49,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176772074] [2020-11-28 03:13:49,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:49,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:13:49,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147280047] [2020-11-28 03:13:49,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:13:49,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:49,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:13:49,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:13:49,294 INFO L87 Difference]: Start difference. First operand 2134 states and 6763 transitions. Second operand 5 states. [2020-11-28 03:13:49,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:49,392 INFO L93 Difference]: Finished difference Result 1821 states and 5308 transitions. [2020-11-28 03:13:49,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:13:49,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-11-28 03:13:49,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:49,399 INFO L225 Difference]: With dead ends: 1821 [2020-11-28 03:13:49,399 INFO L226 Difference]: Without dead ends: 1391 [2020-11-28 03:13:49,400 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-28 03:13:49,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2020-11-28 03:13:49,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1391. [2020-11-28 03:13:49,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1391 states. [2020-11-28 03:13:49,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 3979 transitions. [2020-11-28 03:13:49,456 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 3979 transitions. Word has length 18 [2020-11-28 03:13:49,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:49,456 INFO L481 AbstractCegarLoop]: Abstraction has 1391 states and 3979 transitions. [2020-11-28 03:13:49,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:13:49,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 3979 transitions. [2020-11-28 03:13:49,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 03:13:49,464 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:49,464 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] [2020-11-28 03:13:49,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 03:13:49,465 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:49,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:49,466 INFO L82 PathProgramCache]: Analyzing trace with hash 2000414982, now seen corresponding path program 1 times [2020-11-28 03:13:49,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:49,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367250159] [2020-11-28 03:13:49,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:49,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:49,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367250159] [2020-11-28 03:13:49,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:49,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:13:49,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548281064] [2020-11-28 03:13:49,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:13:49,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:49,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:13:49,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:49,553 INFO L87 Difference]: Start difference. First operand 1391 states and 3979 transitions. Second operand 3 states. [2020-11-28 03:13:49,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:49,577 INFO L93 Difference]: Finished difference Result 1973 states and 5494 transitions. [2020-11-28 03:13:49,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:13:49,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-11-28 03:13:49,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:49,584 INFO L225 Difference]: With dead ends: 1973 [2020-11-28 03:13:49,584 INFO L226 Difference]: Without dead ends: 1414 [2020-11-28 03:13:49,585 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-28 03:13:49,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-11-28 03:13:49,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1381. [2020-11-28 03:13:49,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1381 states. [2020-11-28 03:13:49,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 3793 transitions. [2020-11-28 03:13:49,637 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 3793 transitions. Word has length 21 [2020-11-28 03:13:49,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:49,638 INFO L481 AbstractCegarLoop]: Abstraction has 1381 states and 3793 transitions. [2020-11-28 03:13:49,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:13:49,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 3793 transitions. [2020-11-28 03:13:49,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 03:13:49,643 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:49,643 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] [2020-11-28 03:13:49,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 03:13:49,644 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:49,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:49,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1652458450, now seen corresponding path program 1 times [2020-11-28 03:13:49,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:49,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437586046] [2020-11-28 03:13:49,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:49,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:49,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437586046] [2020-11-28 03:13:49,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:49,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:13:49,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650979933] [2020-11-28 03:13:49,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:13:49,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:49,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:13:49,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:13:49,838 INFO L87 Difference]: Start difference. First operand 1381 states and 3793 transitions. Second operand 6 states. [2020-11-28 03:13:49,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:49,918 INFO L93 Difference]: Finished difference Result 1228 states and 3330 transitions. [2020-11-28 03:13:49,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:13:49,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-11-28 03:13:49,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:49,921 INFO L225 Difference]: With dead ends: 1228 [2020-11-28 03:13:49,922 INFO L226 Difference]: Without dead ends: 938 [2020-11-28 03:13:49,922 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-28 03:13:49,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2020-11-28 03:13:49,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 938. [2020-11-28 03:13:49,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2020-11-28 03:13:49,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 2537 transitions. [2020-11-28 03:13:49,957 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 2537 transitions. Word has length 21 [2020-11-28 03:13:49,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:49,958 INFO L481 AbstractCegarLoop]: Abstraction has 938 states and 2537 transitions. [2020-11-28 03:13:49,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:13:49,958 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 2537 transitions. [2020-11-28 03:13:49,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-28 03:13:49,962 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:49,962 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] [2020-11-28 03:13:49,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 03:13:49,962 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:49,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:49,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1880028900, now seen corresponding path program 1 times [2020-11-28 03:13:49,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:49,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43213126] [2020-11-28 03:13:49,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:50,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43213126] [2020-11-28 03:13:50,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:50,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 03:13:50,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331773862] [2020-11-28 03:13:50,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 03:13:50,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:50,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 03:13:50,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:13:50,189 INFO L87 Difference]: Start difference. First operand 938 states and 2537 transitions. Second operand 7 states. [2020-11-28 03:13:50,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:50,279 INFO L93 Difference]: Finished difference Result 909 states and 2480 transitions. [2020-11-28 03:13:50,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 03:13:50,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-11-28 03:13:50,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:50,282 INFO L225 Difference]: With dead ends: 909 [2020-11-28 03:13:50,282 INFO L226 Difference]: Without dead ends: 343 [2020-11-28 03:13:50,283 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-28 03:13:50,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-11-28 03:13:50,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2020-11-28 03:13:50,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-11-28 03:13:50,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 940 transitions. [2020-11-28 03:13:50,295 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 940 transitions. Word has length 24 [2020-11-28 03:13:50,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:50,296 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 940 transitions. [2020-11-28 03:13:50,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 03:13:50,296 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 940 transitions. [2020-11-28 03:13:50,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-28 03:13:50,298 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:50,298 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, 1, 1] [2020-11-28 03:13:50,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 03:13:50,299 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:50,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:50,299 INFO L82 PathProgramCache]: Analyzing trace with hash -528681227, now seen corresponding path program 1 times [2020-11-28 03:13:50,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:50,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773843163] [2020-11-28 03:13:50,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:50,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:50,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773843163] [2020-11-28 03:13:50,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:50,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 03:13:50,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961736440] [2020-11-28 03:13:50,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-28 03:13:50,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:50,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-28 03:13:50,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:13:50,746 INFO L87 Difference]: Start difference. First operand 343 states and 940 transitions. Second operand 8 states. [2020-11-28 03:13:50,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:50,968 INFO L93 Difference]: Finished difference Result 562 states and 1496 transitions. [2020-11-28 03:13:50,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:13:50,969 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-11-28 03:13:50,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:50,971 INFO L225 Difference]: With dead ends: 562 [2020-11-28 03:13:50,971 INFO L226 Difference]: Without dead ends: 344 [2020-11-28 03:13:50,972 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-28 03:13:50,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2020-11-28 03:13:50,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 293. [2020-11-28 03:13:50,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2020-11-28 03:13:50,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 780 transitions. [2020-11-28 03:13:50,983 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 780 transitions. Word has length 28 [2020-11-28 03:13:50,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:50,983 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 780 transitions. [2020-11-28 03:13:50,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-28 03:13:50,984 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 780 transitions. [2020-11-28 03:13:50,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-28 03:13:50,988 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:50,988 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, 1, 1] [2020-11-28 03:13:50,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 03:13:50,989 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:50,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:50,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1283252781, now seen corresponding path program 2 times [2020-11-28 03:13:50,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:50,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605047866] [2020-11-28 03:13:50,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:51,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605047866] [2020-11-28 03:13:51,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:51,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 03:13:51,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228284318] [2020-11-28 03:13:51,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-28 03:13:51,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:51,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-28 03:13:51,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:13:51,356 INFO L87 Difference]: Start difference. First operand 293 states and 780 transitions. Second operand 8 states. [2020-11-28 03:13:51,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:51,644 INFO L93 Difference]: Finished difference Result 445 states and 1138 transitions. [2020-11-28 03:13:51,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:13:51,646 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-11-28 03:13:51,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:51,647 INFO L225 Difference]: With dead ends: 445 [2020-11-28 03:13:51,647 INFO L226 Difference]: Without dead ends: 278 [2020-11-28 03:13:51,648 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-28 03:13:51,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-11-28 03:13:51,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 241. [2020-11-28 03:13:51,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-11-28 03:13:51,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 590 transitions. [2020-11-28 03:13:51,657 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 590 transitions. Word has length 28 [2020-11-28 03:13:51,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:51,658 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 590 transitions. [2020-11-28 03:13:51,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-28 03:13:51,658 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 590 transitions. [2020-11-28 03:13:51,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-28 03:13:51,659 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:51,660 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, 1, 1] [2020-11-28 03:13:51,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-28 03:13:51,660 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:51,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:51,661 INFO L82 PathProgramCache]: Analyzing trace with hash 578136181, now seen corresponding path program 3 times [2020-11-28 03:13:51,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:51,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967388892] [2020-11-28 03:13:51,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:13:51,780 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:13:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:13:51,914 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:13:51,980 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:13:51,980 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 03:13:51,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-28 03:13:51,982 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-11-28 03:13:52,015 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1215] [1215] L878-->L885: Formula: (let ((.cse6 (= (mod ~b$w_buff1_used~0_In-182357489 256) 0)) (.cse7 (= (mod ~b$r_buff1_thd0~0_In-182357489 256) 0)) (.cse8 (= (mod ~b$w_buff0_used~0_In-182357489 256) 0)) (.cse9 (= (mod ~b$r_buff0_thd0~0_In-182357489 256) 0))) (let ((.cse5 (or .cse8 .cse9)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse6 .cse7)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-182357489 0)) (or (and .cse0 .cse1 (= ~b$w_buff0~0_In-182357489 ~b~0_Out-182357489)) (and (or (and (= ~b~0_Out-182357489 ~b~0_In-182357489) .cse2) (and .cse3 (= ~b~0_Out-182357489 ~b$w_buff1~0_In-182357489) .cse4)) .cse5)) (= ~b$r_buff1_thd0~0_Out-182357489 ~b$r_buff1_thd0~0_In-182357489) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-182357489 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-182357489|) (= ~b$r_buff0_thd0~0_Out-182357489 ~b$r_buff0_thd0~0_In-182357489) (or (and .cse5 (= ~b$w_buff0_used~0_In-182357489 ~b$w_buff0_used~0_Out-182357489)) (and .cse0 .cse1 (= ~b$w_buff0_used~0_Out-182357489 0))) (or (and (= ~b$w_buff1_used~0_In-182357489 ~b$w_buff1_used~0_Out-182357489) .cse2) (and (= ~b$w_buff1_used~0_Out-182357489 0) .cse3 .cse4))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-182357489, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-182357489|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-182357489, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-182357489, ~b~0=~b~0_In-182357489, ~b$w_buff1~0=~b$w_buff1~0_In-182357489, ~b$w_buff0~0=~b$w_buff0~0_In-182357489, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-182357489} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out-182357489, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-182357489|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-182357489|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-182357489|, ULTIMATE.start_main_#t~ite56=|ULTIMATE.start_main_#t~ite56_Out-182357489|, ~b$w_buff0_used~0=~b$w_buff0_used~0_Out-182357489, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-182357489|, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-182357489|, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-182357489|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-182357489, ~b$w_buff1_used~0=~b$w_buff1_used~0_Out-182357489, ~b~0=~b~0_Out-182357489, ~b$w_buff1~0=~b$w_buff1~0_In-182357489, ~b$w_buff0~0=~b$w_buff0~0_In-182357489, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_Out-182357489} AuxVars[] AssignedVars[~b$w_buff0_used~0, ULTIMATE.start_main_#t~ite60, ~b$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_assume_abort_if_not_~cond, ~b$w_buff1_used~0, ~b~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ULTIMATE.start_main_#t~ite56, ~b$r_buff0_thd0~0] because there is no mapped edge [2020-11-28 03:13:52,022 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-28 03:13:52,023 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,023 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-28 03:13:52,024 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [749] [2020-11-28 03:13:52,028 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-28 03:13:52,028 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,029 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-28 03:13:52,029 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,029 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-28 03:13:52,029 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,030 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-28 03:13:52,030 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,030 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-28 03:13:52,030 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,033 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-28 03:13:52,034 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,034 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-28 03:13:52,034 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,034 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-28 03:13:52,035 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,035 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-28 03:13:52,035 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,035 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-28 03:13:52,035 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,036 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-28 03:13:52,037 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,037 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-28 03:13:52,037 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,038 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-28 03:13:52,038 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,043 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-28 03:13:52,044 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,044 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-28 03:13:52,044 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,045 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-28 03:13:52,045 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,045 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-28 03:13:52,045 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,046 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-28 03:13:52,046 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,046 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-28 03:13:52,047 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,047 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-28 03:13:52,047 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,047 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-28 03:13:52,048 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,048 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-28 03:13:52,048 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,048 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-28 03:13:52,049 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,049 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-28 03:13:52,049 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,049 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-28 03:13:52,050 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,050 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-28 03:13:52,050 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,050 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-28 03:13:52,051 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,051 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-28 03:13:52,051 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,052 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-28 03:13:52,052 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,052 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-28 03:13:52,052 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,053 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-28 03:13:52,053 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,053 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-28 03:13:52,053 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,054 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-28 03:13:52,054 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,054 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-28 03:13:52,054 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:13:52 BasicIcfg [2020-11-28 03:13:52,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 03:13:52,180 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:13:52,180 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:13:52,180 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:13:52,180 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:13:37" (3/4) ... [2020-11-28 03:13:52,182 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 03:13:52,198 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1215] [1215] L878-->L885: Formula: (let ((.cse6 (= (mod ~b$w_buff1_used~0_In-182357489 256) 0)) (.cse7 (= (mod ~b$r_buff1_thd0~0_In-182357489 256) 0)) (.cse8 (= (mod ~b$w_buff0_used~0_In-182357489 256) 0)) (.cse9 (= (mod ~b$r_buff0_thd0~0_In-182357489 256) 0))) (let ((.cse5 (or .cse8 .cse9)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse6 .cse7)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-182357489 0)) (or (and .cse0 .cse1 (= ~b$w_buff0~0_In-182357489 ~b~0_Out-182357489)) (and (or (and (= ~b~0_Out-182357489 ~b~0_In-182357489) .cse2) (and .cse3 (= ~b~0_Out-182357489 ~b$w_buff1~0_In-182357489) .cse4)) .cse5)) (= ~b$r_buff1_thd0~0_Out-182357489 ~b$r_buff1_thd0~0_In-182357489) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-182357489 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-182357489|) (= ~b$r_buff0_thd0~0_Out-182357489 ~b$r_buff0_thd0~0_In-182357489) (or (and .cse5 (= ~b$w_buff0_used~0_In-182357489 ~b$w_buff0_used~0_Out-182357489)) (and .cse0 .cse1 (= ~b$w_buff0_used~0_Out-182357489 0))) (or (and (= ~b$w_buff1_used~0_In-182357489 ~b$w_buff1_used~0_Out-182357489) .cse2) (and (= ~b$w_buff1_used~0_Out-182357489 0) .cse3 .cse4))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-182357489, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-182357489|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-182357489, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-182357489, ~b~0=~b~0_In-182357489, ~b$w_buff1~0=~b$w_buff1~0_In-182357489, ~b$w_buff0~0=~b$w_buff0~0_In-182357489, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-182357489} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out-182357489, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-182357489|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-182357489|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-182357489|, ULTIMATE.start_main_#t~ite56=|ULTIMATE.start_main_#t~ite56_Out-182357489|, ~b$w_buff0_used~0=~b$w_buff0_used~0_Out-182357489, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-182357489|, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-182357489|, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-182357489|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-182357489, ~b$w_buff1_used~0=~b$w_buff1_used~0_Out-182357489, ~b~0=~b~0_Out-182357489, ~b$w_buff1~0=~b$w_buff1~0_In-182357489, ~b$w_buff0~0=~b$w_buff0~0_In-182357489, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_Out-182357489} AuxVars[] AssignedVars[~b$w_buff0_used~0, ULTIMATE.start_main_#t~ite60, ~b$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_assume_abort_if_not_~cond, ~b$w_buff1_used~0, ~b~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ULTIMATE.start_main_#t~ite56, ~b$r_buff0_thd0~0] because there is no mapped edge [2020-11-28 03:13:52,200 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-28 03:13:52,200 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,200 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-28 03:13:52,201 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [749] [2020-11-28 03:13:52,201 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-28 03:13:52,201 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,201 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-28 03:13:52,201 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,201 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-28 03:13:52,201 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,201 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-28 03:13:52,202 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,202 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-28 03:13:52,202 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,202 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-28 03:13:52,203 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,203 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-28 03:13:52,203 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,203 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-28 03:13:52,203 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,204 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-28 03:13:52,204 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,204 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-28 03:13:52,204 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,205 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-28 03:13:52,205 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,205 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-28 03:13:52,206 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,206 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-28 03:13:52,206 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,206 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-28 03:13:52,206 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,207 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-28 03:13:52,207 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,207 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-28 03:13:52,207 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,207 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-28 03:13:52,207 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,208 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-28 03:13:52,208 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,208 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-28 03:13:52,208 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,208 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-28 03:13:52,209 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,209 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-28 03:13:52,209 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,209 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-28 03:13:52,210 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,210 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-28 03:13:52,210 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,210 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-28 03:13:52,210 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,211 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-28 03:13:52,211 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,211 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-28 03:13:52,211 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,211 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-28 03:13:52,212 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,212 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-28 03:13:52,212 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,212 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-28 03:13:52,213 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,213 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-28 03:13:52,213 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,213 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-28 03:13:52,213 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,214 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-28 03:13:52,214 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,214 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-28 03:13:52,214 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,214 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-28 03:13:52,215 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:13:52,368 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_92511188-934c-444e-8415-ff59096871ed/bin/uautomizer/witness.graphml [2020-11-28 03:13:52,368 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:13:52,370 INFO L168 Benchmark]: Toolchain (without parser) took 19481.39 ms. Allocated memory was 94.4 MB in the beginning and 383.8 MB in the end (delta: 289.4 MB). Free memory was 63.1 MB in the beginning and 105.3 MB in the end (delta: -42.2 MB). Peak memory consumption was 247.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:13:52,370 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 75.5 MB. Free memory was 32.4 MB in the beginning and 32.4 MB in the end (delta: 56.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:13:52,371 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1042.80 ms. Allocated memory is still 94.4 MB. Free memory was 63.1 MB in the beginning and 46.3 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-28 03:13:52,371 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.20 ms. Allocated memory is still 94.4 MB. Free memory was 46.3 MB in the beginning and 44.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:13:52,372 INFO L168 Benchmark]: Boogie Preprocessor took 82.06 ms. Allocated memory is still 94.4 MB. Free memory was 44.1 MB in the beginning and 41.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:13:52,372 INFO L168 Benchmark]: RCFGBuilder took 3436.05 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.6 MB in the beginning and 110.9 MB in the end (delta: -69.3 MB). Peak memory consumption was 31.8 MB. Max. memory is 16.1 GB. [2020-11-28 03:13:52,373 INFO L168 Benchmark]: TraceAbstraction took 14644.48 ms. Allocated memory was 144.7 MB in the beginning and 383.8 MB in the end (delta: 239.1 MB). Free memory was 110.9 MB in the beginning and 131.5 MB in the end (delta: -20.6 MB). Peak memory consumption was 218.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:13:52,373 INFO L168 Benchmark]: Witness Printer took 188.75 ms. Allocated memory is still 383.8 MB. Free memory was 131.5 MB in the beginning and 105.3 MB in the end (delta: 26.2 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. [2020-11-28 03:13:52,377 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.32 ms. Allocated memory is still 75.5 MB. Free memory was 32.4 MB in the beginning and 32.4 MB in the end (delta: 56.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1042.80 ms. Allocated memory is still 94.4 MB. Free memory was 63.1 MB in the beginning and 46.3 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 76.20 ms. Allocated memory is still 94.4 MB. Free memory was 46.3 MB in the beginning and 44.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 82.06 ms. Allocated memory is still 94.4 MB. Free memory was 44.1 MB in the beginning and 41.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3436.05 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.6 MB in the beginning and 110.9 MB in the end (delta: -69.3 MB). Peak memory consumption was 31.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14644.48 ms. Allocated memory was 144.7 MB in the beginning and 383.8 MB in the end (delta: 239.1 MB). Free memory was 110.9 MB in the beginning and 131.5 MB in the end (delta: -20.6 MB). Peak memory consumption was 218.5 MB. Max. memory is 16.1 GB. * Witness Printer took 188.75 ms. Allocated memory is still 383.8 MB. Free memory was 131.5 MB in the beginning and 105.3 MB in the end (delta: 26.2 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 2036 VarBasedMoverChecksPositive, 95 VarBasedMoverChecksNegative, 34 SemBasedMoverChecksPositive, 61 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 220 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.2s, 132 PlacesBefore, 47 PlacesAfterwards, 122 TransitionsBefore, 34 TransitionsAfterwards, 3124 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 105 TotalNumberOfCompositions, 8823 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 __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool b$flush_delayed; [L720] 0 int b$mem_tmp; [L721] 0 _Bool b$r_buff0_thd0; [L722] 0 _Bool b$r_buff0_thd1; [L723] 0 _Bool b$r_buff0_thd2; [L724] 0 _Bool b$r_buff0_thd3; [L725] 0 _Bool b$r_buff0_thd4; [L726] 0 _Bool b$r_buff1_thd0; [L727] 0 _Bool b$r_buff1_thd1; [L728] 0 _Bool b$r_buff1_thd2; [L729] 0 _Bool b$r_buff1_thd3; [L730] 0 _Bool b$r_buff1_thd4; [L731] 0 _Bool b$read_delayed; [L732] 0 int *b$read_delayed_var; [L733] 0 int b$w_buff0; [L734] 0 _Bool b$w_buff0_used; [L735] 0 int b$w_buff1; [L736] 0 _Bool b$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L867] 0 pthread_t t1265; [L868] FCALL, FORK 0 pthread_create(&t1265, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 b$w_buff1 = b$w_buff0 [L751] 1 b$w_buff0 = 1 [L752] 1 b$w_buff1_used = b$w_buff0_used [L753] 1 b$w_buff0_used = (_Bool)1 [L18] COND TRUE 1 !expression [L17] COND FALSE 1 !(0) [L17] 1 __assert_fail ("0", "mix047_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) [L755] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L756] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L757] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L758] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L759] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L760] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L869] 0 pthread_t t1266; [L870] FCALL, FORK 0 pthread_create(&t1266, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L786] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L787] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L787] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L788] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L788] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L789] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L789] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L790] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L790] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L871] 0 pthread_t t1267; [L872] FCALL, FORK 0 pthread_create(&t1267, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L873] 0 pthread_t t1268; [L874] FCALL, FORK 0 pthread_create(&t1268, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L800] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L806] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L806] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L807] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L807] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L808] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L808] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L809] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L809] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L810] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L810] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L820] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L823] 4 a = 1 [L826] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L829] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 4 b$flush_delayed = weak$$choice2 [L832] 4 b$mem_tmp = b [L833] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L833] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1 [L833] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L833] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L834] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L834] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L835] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L835] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1) [L835] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1 [L835] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1) [L835] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L835] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L836] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L836] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L837] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L837] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0 [L837] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L837] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L838] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L839] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 __unbuffered_p3_EBX = b [L841] EXPR 4 b$flush_delayed ? b$mem_tmp : b [L841] 4 b = b$flush_delayed ? b$mem_tmp : b [L842] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, z=2] [L766] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L766] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L767] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L767] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L768] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L768] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L769] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L769] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L770] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L770] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L845] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L845] EXPR 4 b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b [L845] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L845] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L846] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L846] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L847] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L847] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L848] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L848] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L849] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L849] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L852] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L854] 4 return 0; [L876] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L887] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix047_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 120 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.2s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.6s, HoareTripleCheckerStatistics: 475 SDtfs, 544 SDslu, 796 SDs, 0 SdLazy, 293 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4874occurred 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.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 592 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 30035 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...