./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix055_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3710bb61-4be8-4dbc-80d7-decaf2c679bd/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_3710bb61-4be8-4dbc-80d7-decaf2c679bd/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3710bb61-4be8-4dbc-80d7-decaf2c679bd/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3710bb61-4be8-4dbc-80d7-decaf2c679bd/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix055_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3710bb61-4be8-4dbc-80d7-decaf2c679bd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3710bb61-4be8-4dbc-80d7-decaf2c679bd/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 3185c071283d37c0176606f498a5ecf4d9de13e0 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 00:29:33,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:29:33,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:29:34,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:29:34,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:29:34,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:29:34,079 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:29:34,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:29:34,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:29:34,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:29:34,086 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:29:34,089 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:29:34,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:29:34,099 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:29:34,101 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:29:34,104 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:29:34,105 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:29:34,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:29:34,114 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:29:34,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:29:34,131 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:29:34,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:29:34,136 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:29:34,137 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:29:34,144 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:29:34,144 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:29:34,145 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:29:34,147 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:29:34,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:29:34,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:29:34,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:29:34,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:29:34,153 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:29:34,154 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:29:34,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:29:34,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:29:34,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:29:34,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:29:34,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:29:34,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:29:34,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:29:34,162 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3710bb61-4be8-4dbc-80d7-decaf2c679bd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 00:29:34,203 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:29:34,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:29:34,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:29:34,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:29:34,206 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:29:34,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:29:34,206 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:29:34,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:29:34,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:29:34,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:29:34,208 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 00:29:34,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 00:29:34,209 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 00:29:34,209 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:29:34,209 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:29:34,209 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:29:34,210 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 00:29:34,210 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:29:34,210 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:29:34,210 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 00:29:34,211 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 00:29:34,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:29:34,211 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:29:34,211 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 00:29:34,212 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 00:29:34,212 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:29:34,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 00:29:34,212 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 00:29:34,213 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:29:34,213 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_3710bb61-4be8-4dbc-80d7-decaf2c679bd/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_3710bb61-4be8-4dbc-80d7-decaf2c679bd/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 -> 3185c071283d37c0176606f498a5ecf4d9de13e0 [2020-11-30 00:29:34,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:29:34,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:29:34,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:29:34,616 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:29:34,617 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:29:34,618 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3710bb61-4be8-4dbc-80d7-decaf2c679bd/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix055_rmo.opt.i [2020-11-30 00:29:34,727 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3710bb61-4be8-4dbc-80d7-decaf2c679bd/bin/uautomizer/data/a16089547/f339df838906435b82a18e18c2a3737b/FLAGbdc216362 [2020-11-30 00:29:35,372 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:29:35,373 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3710bb61-4be8-4dbc-80d7-decaf2c679bd/sv-benchmarks/c/pthread-wmm/mix055_rmo.opt.i [2020-11-30 00:29:35,396 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3710bb61-4be8-4dbc-80d7-decaf2c679bd/bin/uautomizer/data/a16089547/f339df838906435b82a18e18c2a3737b/FLAGbdc216362 [2020-11-30 00:29:35,611 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3710bb61-4be8-4dbc-80d7-decaf2c679bd/bin/uautomizer/data/a16089547/f339df838906435b82a18e18c2a3737b [2020-11-30 00:29:35,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:29:35,614 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:29:35,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:29:35,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:29:35,620 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:29:35,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:29:35" (1/1) ... [2020-11-30 00:29:35,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55762608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:29:35, skipping insertion in model container [2020-11-30 00:29:35,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:29:35" (1/1) ... [2020-11-30 00:29:35,632 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:29:35,707 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:29:36,167 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:29:36,179 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:29:36,280 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:29:36,386 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:29:36,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:29:36 WrapperNode [2020-11-30 00:29:36,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:29:36,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:29:36,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:29:36,390 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:29:36,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:29:36" (1/1) ... [2020-11-30 00:29:36,444 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:29:36" (1/1) ... [2020-11-30 00:29:36,496 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:29:36,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:29:36,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:29:36,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:29:36,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:29:36" (1/1) ... [2020-11-30 00:29:36,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:29:36" (1/1) ... [2020-11-30 00:29:36,515 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:29:36" (1/1) ... [2020-11-30 00:29:36,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:29:36" (1/1) ... [2020-11-30 00:29:36,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:29:36" (1/1) ... [2020-11-30 00:29:36,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:29:36" (1/1) ... [2020-11-30 00:29:36,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:29:36" (1/1) ... [2020-11-30 00:29:36,575 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:29:36,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:29:36,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:29:36,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:29:36,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:29:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3710bb61-4be8-4dbc-80d7-decaf2c679bd/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:29:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 00:29:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-30 00:29:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:29:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 00:29:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-30 00:29:36,656 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-30 00:29:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-30 00:29:36,656 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-30 00:29:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-30 00:29:36,657 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-30 00:29:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-30 00:29:36,657 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-30 00:29:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 00:29:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-30 00:29:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:29:36,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:29:36,659 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-30 00:29:39,616 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:29:39,616 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-30 00:29:39,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:29:39 BoogieIcfgContainer [2020-11-30 00:29:39,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:29:39,622 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 00:29:39,622 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 00:29:39,627 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 00:29:39,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:29:35" (1/3) ... [2020-11-30 00:29:39,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9716e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:29:39, skipping insertion in model container [2020-11-30 00:29:39,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:29:36" (2/3) ... [2020-11-30 00:29:39,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9716e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:29:39, skipping insertion in model container [2020-11-30 00:29:39,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:29:39" (3/3) ... [2020-11-30 00:29:39,633 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_rmo.opt.i [2020-11-30 00:29:39,651 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-30 00:29:39,651 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 00:29:39,657 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-30 00:29:39,658 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-30 00:29:39,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,710 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,710 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,713 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,713 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,715 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,715 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,720 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,721 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,721 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,721 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,721 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,721 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,722 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,723 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,723 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,723 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,723 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,724 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,724 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,724 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,725 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,725 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,725 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,725 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,726 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,726 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,726 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,729 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,730 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,731 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,735 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,735 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,739 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,740 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,745 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,745 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:29:39,768 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-30 00:29:39,781 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-30 00:29:39,816 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 00:29:39,816 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 00:29:39,816 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 00:29:39,817 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:29:39,817 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:29:39,817 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 00:29:39,817 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:29:39,818 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 00:29:39,837 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-30 00:29:39,842 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 117 transitions, 254 flow [2020-11-30 00:29:39,847 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 117 transitions, 254 flow [2020-11-30 00:29:39,850 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 127 places, 117 transitions, 254 flow [2020-11-30 00:29:39,946 INFO L129 PetriNetUnfolder]: 3/113 cut-off events. [2020-11-30 00:29:39,946 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-30 00:29:39,955 INFO L80 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 3/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2020-11-30 00:29:39,964 INFO L116 LiptonReduction]: Number of co-enabled transitions 2622 [2020-11-30 00:29:40,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 00:29:40,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:40,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 00:29:40,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:40,766 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-30 00:29:40,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:29:40,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:40,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:29:40,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:40,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:29:40,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:40,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:29:40,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:42,328 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-11-30 00:29:42,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-11-30 00:29:42,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:42,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:29:42,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:43,693 WARN L193 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 145 DAG size of output: 124 [2020-11-30 00:29:43,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 00:29:43,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:44,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:29:44,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:44,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:44,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:44,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:44,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:29:44,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:29:44,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:29:44,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:44,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:44,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:44,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:44,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:44,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:29:44,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:29:44,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:29:45,190 WARN L193 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-30 00:29:45,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:29:45,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:45,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:45,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:45,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:45,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:29:45,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:29:45,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:29:45,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:29:45,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:45,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:45,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:45,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:45,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:29:45,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:29:45,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:29:45,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 00:29:45,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:45,795 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-11-30 00:29:47,614 WARN L193 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2020-11-30 00:29:47,964 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-30 00:29:48,604 WARN L193 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2020-11-30 00:29:48,956 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-30 00:29:49,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 7, 2, 2, 1] term [2020-11-30 00:29:49,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:49,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 2, 1] term [2020-11-30 00:29:49,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:49,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:49,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:49,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:49,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:49,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:49,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:49,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:49,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:49,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 2, 1] term [2020-11-30 00:29:49,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:49,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:49,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:49,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:49,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:49,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 3, 7, 3, 2, 1] term [2020-11-30 00:29:49,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:29:49,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 7, 3, 7, 3, 2, 1] term [2020-11-30 00:29:49,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:49,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 7, 2, 2, 1] term [2020-11-30 00:29:49,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:49,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 2, 1] term [2020-11-30 00:29:49,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:49,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:49,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:49,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:49,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:49,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:49,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:49,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:49,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:49,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 2, 1] term [2020-11-30 00:29:49,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:49,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:49,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:49,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:49,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:49,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 3, 7, 3, 2, 1] term [2020-11-30 00:29:49,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:29:49,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 7, 3, 7, 3, 2, 1] term [2020-11-30 00:29:49,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:49,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 3, 7, 3, 2, 1] term [2020-11-30 00:29:49,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:29:49,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 7, 3, 7, 3, 2, 1] term [2020-11-30 00:29:49,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:49,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 7, 2, 2, 1] term [2020-11-30 00:29:49,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:49,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 2, 1] term [2020-11-30 00:29:49,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:49,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:49,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:49,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:49,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:49,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:49,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:49,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:49,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:49,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 2, 1] term [2020-11-30 00:29:49,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:49,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:49,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:49,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:49,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:50,901 WARN L193 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 143 DAG size of output: 134 [2020-11-30 00:29:51,291 WARN L193 SmtUtils]: Spent 387.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-11-30 00:29:51,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 3, 7, 3, 2, 1] term [2020-11-30 00:29:51,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:29:51,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 7, 3, 7, 3, 2, 1] term [2020-11-30 00:29:51,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:51,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 7, 2, 2, 1] term [2020-11-30 00:29:51,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:51,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 2, 1] term [2020-11-30 00:29:51,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:51,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:51,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:51,346 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:51,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:29:51,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:51,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:51,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:51,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:51,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 2, 1] term [2020-11-30 00:29:51,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:51,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:51,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:51,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:29:51,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:29:51,975 WARN L193 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-11-30 00:29:52,259 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-11-30 00:29:52,446 INFO L131 LiptonReduction]: Checked pairs total: 6769 [2020-11-30 00:29:52,446 INFO L133 LiptonReduction]: Total number of compositions: 105 [2020-11-30 00:29:52,452 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2020-11-30 00:29:52,646 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2602 states. [2020-11-30 00:29:52,648 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states. [2020-11-30 00:29:52,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 00:29:52,657 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:29:52,657 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:29:52,658 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:29:52,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:29:52,664 INFO L82 PathProgramCache]: Analyzing trace with hash 172921797, now seen corresponding path program 1 times [2020-11-30 00:29:52,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:29:52,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944201899] [2020-11-30 00:29:52,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:29:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:29:53,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:29:53,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944201899] [2020-11-30 00:29:53,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:29:53,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-30 00:29:53,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591461863] [2020-11-30 00:29:53,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:29:53,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:29:53,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:29:53,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:29:53,110 INFO L87 Difference]: Start difference. First operand 2602 states. Second operand 3 states. [2020-11-30 00:29:53,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:29:53,268 INFO L93 Difference]: Finished difference Result 2202 states and 8424 transitions. [2020-11-30 00:29:53,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:29:53,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-30 00:29:53,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:29:53,324 INFO L225 Difference]: With dead ends: 2202 [2020-11-30 00:29:53,325 INFO L226 Difference]: Without dead ends: 1802 [2020-11-30 00:29:53,326 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:29:53,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-11-30 00:29:53,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2020-11-30 00:29:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-11-30 00:29:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2020-11-30 00:29:53,508 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2020-11-30 00:29:53,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:29:53,509 INFO L481 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2020-11-30 00:29:53,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:29:53,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2020-11-30 00:29:53,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-30 00:29:53,515 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:29:53,516 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:29:53,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 00:29:53,517 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:29:53,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:29:53,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1325818042, now seen corresponding path program 1 times [2020-11-30 00:29:53,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:29:53,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068853487] [2020-11-30 00:29:53,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:29:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:29:53,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:29:53,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068853487] [2020-11-30 00:29:53,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:29:53,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-30 00:29:53,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537757648] [2020-11-30 00:29:53,669 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:29:53,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:29:53,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:29:53,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:29:53,670 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand 3 states. [2020-11-30 00:29:53,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:29:53,708 INFO L93 Difference]: Finished difference Result 1752 states and 6554 transitions. [2020-11-30 00:29:53,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:29:53,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-30 00:29:53,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:29:53,729 INFO L225 Difference]: With dead ends: 1752 [2020-11-30 00:29:53,729 INFO L226 Difference]: Without dead ends: 1752 [2020-11-30 00:29:53,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:29:53,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2020-11-30 00:29:53,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2020-11-30 00:29:53,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2020-11-30 00:29:53,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 6554 transitions. [2020-11-30 00:29:53,828 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 6554 transitions. Word has length 11 [2020-11-30 00:29:53,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:29:53,828 INFO L481 AbstractCegarLoop]: Abstraction has 1752 states and 6554 transitions. [2020-11-30 00:29:53,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:29:53,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 6554 transitions. [2020-11-30 00:29:53,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-30 00:29:53,831 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:29:53,832 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:29:53,832 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 00:29:53,832 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:29:53,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:29:53,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1861488477, now seen corresponding path program 1 times [2020-11-30 00:29:53,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:29:53,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784759848] [2020-11-30 00:29:53,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:29:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:29:53,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:29:53,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784759848] [2020-11-30 00:29:53,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:29:53,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-30 00:29:53,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916510834] [2020-11-30 00:29:53,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:29:53,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:29:53,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:29:53,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:29:53,950 INFO L87 Difference]: Start difference. First operand 1752 states and 6554 transitions. Second operand 3 states. [2020-11-30 00:29:54,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:29:54,016 INFO L93 Difference]: Finished difference Result 1682 states and 6258 transitions. [2020-11-30 00:29:54,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:29:54,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-11-30 00:29:54,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:29:54,036 INFO L225 Difference]: With dead ends: 1682 [2020-11-30 00:29:54,037 INFO L226 Difference]: Without dead ends: 1682 [2020-11-30 00:29:54,038 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:29:54,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2020-11-30 00:29:54,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1682. [2020-11-30 00:29:54,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2020-11-30 00:29:54,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 6258 transitions. [2020-11-30 00:29:54,171 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 6258 transitions. Word has length 12 [2020-11-30 00:29:54,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:29:54,171 INFO L481 AbstractCegarLoop]: Abstraction has 1682 states and 6258 transitions. [2020-11-30 00:29:54,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:29:54,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 6258 transitions. [2020-11-30 00:29:54,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-30 00:29:54,176 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:29:54,177 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:29:54,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 00:29:54,177 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:29:54,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:29:54,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1871500579, now seen corresponding path program 1 times [2020-11-30 00:29:54,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:29:54,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592567234] [2020-11-30 00:29:54,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:29:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:29:54,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:29:54,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592567234] [2020-11-30 00:29:54,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:29:54,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:29:54,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40624363] [2020-11-30 00:29:54,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:29:54,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:29:54,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:29:54,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:29:54,411 INFO L87 Difference]: Start difference. First operand 1682 states and 6258 transitions. Second operand 5 states. [2020-11-30 00:29:54,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:29:54,529 INFO L93 Difference]: Finished difference Result 1790 states and 6590 transitions. [2020-11-30 00:29:54,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:29:54,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-30 00:29:54,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:29:54,550 INFO L225 Difference]: With dead ends: 1790 [2020-11-30 00:29:54,551 INFO L226 Difference]: Without dead ends: 1790 [2020-11-30 00:29:54,551 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:29:54,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2020-11-30 00:29:54,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1790. [2020-11-30 00:29:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1790 states. [2020-11-30 00:29:54,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 6590 transitions. [2020-11-30 00:29:54,640 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 6590 transitions. Word has length 13 [2020-11-30 00:29:54,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:29:54,640 INFO L481 AbstractCegarLoop]: Abstraction has 1790 states and 6590 transitions. [2020-11-30 00:29:54,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:29:54,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 6590 transitions. [2020-11-30 00:29:54,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-30 00:29:54,644 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:29:54,644 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:29:54,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 00:29:54,644 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:29:54,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:29:54,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1082379228, now seen corresponding path program 1 times [2020-11-30 00:29:54,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:29:54,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497581856] [2020-11-30 00:29:54,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:29:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:29:54,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:29:54,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497581856] [2020-11-30 00:29:54,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:29:54,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:29:54,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895447901] [2020-11-30 00:29:54,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:29:54,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:29:54,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:29:54,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:29:54,825 INFO L87 Difference]: Start difference. First operand 1790 states and 6590 transitions. Second operand 4 states. [2020-11-30 00:29:54,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:29:54,911 INFO L93 Difference]: Finished difference Result 1888 states and 6354 transitions. [2020-11-30 00:29:54,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:29:54,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-30 00:29:54,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:29:54,926 INFO L225 Difference]: With dead ends: 1888 [2020-11-30 00:29:54,926 INFO L226 Difference]: Without dead ends: 1424 [2020-11-30 00:29:54,927 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:29:54,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-11-30 00:29:54,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1424. [2020-11-30 00:29:54,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1424 states. [2020-11-30 00:29:54,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 4760 transitions. [2020-11-30 00:29:54,990 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 4760 transitions. Word has length 15 [2020-11-30 00:29:54,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:29:54,991 INFO L481 AbstractCegarLoop]: Abstraction has 1424 states and 4760 transitions. [2020-11-30 00:29:54,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:29:54,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 4760 transitions. [2020-11-30 00:29:54,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-30 00:29:54,995 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:29:54,995 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:29:54,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 00:29:54,995 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:29:54,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:29:54,996 INFO L82 PathProgramCache]: Analyzing trace with hash -75162851, now seen corresponding path program 1 times [2020-11-30 00:29:54,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:29:54,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800471629] [2020-11-30 00:29:54,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:29:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:29:55,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:29:55,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800471629] [2020-11-30 00:29:55,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:29:55,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:29:55,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584537457] [2020-11-30 00:29:55,159 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:29:55,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:29:55,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:29:55,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:29:55,160 INFO L87 Difference]: Start difference. First operand 1424 states and 4760 transitions. Second operand 5 states. [2020-11-30 00:29:55,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:29:55,254 INFO L93 Difference]: Finished difference Result 1245 states and 3818 transitions. [2020-11-30 00:29:55,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:29:55,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-11-30 00:29:55,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:29:55,265 INFO L225 Difference]: With dead ends: 1245 [2020-11-30 00:29:55,265 INFO L226 Difference]: Without dead ends: 943 [2020-11-30 00:29:55,265 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:29:55,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2020-11-30 00:29:55,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 943. [2020-11-30 00:29:55,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2020-11-30 00:29:55,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2836 transitions. [2020-11-30 00:29:55,308 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2836 transitions. Word has length 16 [2020-11-30 00:29:55,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:29:55,309 INFO L481 AbstractCegarLoop]: Abstraction has 943 states and 2836 transitions. [2020-11-30 00:29:55,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:29:55,309 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2836 transitions. [2020-11-30 00:29:55,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 00:29:55,312 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:29:55,312 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:29:55,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 00:29:55,312 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:29:55,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:29:55,313 INFO L82 PathProgramCache]: Analyzing trace with hash 679643642, now seen corresponding path program 1 times [2020-11-30 00:29:55,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:29:55,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028184290] [2020-11-30 00:29:55,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:29:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:29:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:29:55,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028184290] [2020-11-30 00:29:55,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:29:55,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:29:55,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990912065] [2020-11-30 00:29:55,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:29:55,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:29:55,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:29:55,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:29:55,411 INFO L87 Difference]: Start difference. First operand 943 states and 2836 transitions. Second operand 4 states. [2020-11-30 00:29:55,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:29:55,454 INFO L93 Difference]: Finished difference Result 1294 states and 3807 transitions. [2020-11-30 00:29:55,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:29:55,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-11-30 00:29:55,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:29:55,463 INFO L225 Difference]: With dead ends: 1294 [2020-11-30 00:29:55,463 INFO L226 Difference]: Without dead ends: 840 [2020-11-30 00:29:55,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:29:55,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2020-11-30 00:29:55,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 819. [2020-11-30 00:29:55,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2020-11-30 00:29:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 2322 transitions. [2020-11-30 00:29:55,500 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 2322 transitions. Word has length 18 [2020-11-30 00:29:55,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:29:55,500 INFO L481 AbstractCegarLoop]: Abstraction has 819 states and 2322 transitions. [2020-11-30 00:29:55,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:29:55,500 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 2322 transitions. [2020-11-30 00:29:55,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 00:29:55,502 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:29:55,502 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:29:55,502 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 00:29:55,502 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:29:55,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:29:55,503 INFO L82 PathProgramCache]: Analyzing trace with hash -555388612, now seen corresponding path program 1 times [2020-11-30 00:29:55,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:29:55,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530067217] [2020-11-30 00:29:55,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:29:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:29:55,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:29:55,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530067217] [2020-11-30 00:29:55,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:29:55,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:29:55,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740561387] [2020-11-30 00:29:55,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:29:55,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:29:55,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:29:55,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:29:55,639 INFO L87 Difference]: Start difference. First operand 819 states and 2322 transitions. Second operand 6 states. [2020-11-30 00:29:55,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:29:55,725 INFO L93 Difference]: Finished difference Result 704 states and 1957 transitions. [2020-11-30 00:29:55,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:29:55,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-11-30 00:29:55,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:29:55,731 INFO L225 Difference]: With dead ends: 704 [2020-11-30 00:29:55,731 INFO L226 Difference]: Without dead ends: 614 [2020-11-30 00:29:55,731 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:29:55,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-11-30 00:29:55,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2020-11-30 00:29:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2020-11-30 00:29:55,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 1731 transitions. [2020-11-30 00:29:55,752 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 1731 transitions. Word has length 18 [2020-11-30 00:29:55,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:29:55,753 INFO L481 AbstractCegarLoop]: Abstraction has 614 states and 1731 transitions. [2020-11-30 00:29:55,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:29:55,753 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 1731 transitions. [2020-11-30 00:29:55,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 00:29:55,755 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:29:55,755 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-30 00:29:55,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 00:29:55,756 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:29:55,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:29:55,756 INFO L82 PathProgramCache]: Analyzing trace with hash 934914416, now seen corresponding path program 1 times [2020-11-30 00:29:55,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:29:55,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339180736] [2020-11-30 00:29:55,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:29:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:29:55,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:29:55,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339180736] [2020-11-30 00:29:55,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:29:55,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:29:55,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039148232] [2020-11-30 00:29:55,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:29:55,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:29:55,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:29:55,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:29:55,885 INFO L87 Difference]: Start difference. First operand 614 states and 1731 transitions. Second operand 5 states. [2020-11-30 00:29:55,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:29:55,988 INFO L93 Difference]: Finished difference Result 837 states and 2281 transitions. [2020-11-30 00:29:55,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:29:55,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-11-30 00:29:55,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:29:55,993 INFO L225 Difference]: With dead ends: 837 [2020-11-30 00:29:55,994 INFO L226 Difference]: Without dead ends: 567 [2020-11-30 00:29:55,994 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:29:55,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-11-30 00:29:56,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 547. [2020-11-30 00:29:56,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2020-11-30 00:29:56,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1424 transitions. [2020-11-30 00:29:56,012 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1424 transitions. Word has length 21 [2020-11-30 00:29:56,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:29:56,014 INFO L481 AbstractCegarLoop]: Abstraction has 547 states and 1424 transitions. [2020-11-30 00:29:56,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:29:56,014 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1424 transitions. [2020-11-30 00:29:56,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 00:29:56,016 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:29:56,016 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-30 00:29:56,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 00:29:56,017 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:29:56,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:29:56,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1821973568, now seen corresponding path program 2 times [2020-11-30 00:29:56,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:29:56,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858070016] [2020-11-30 00:29:56,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:29:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:29:56,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:29:56,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858070016] [2020-11-30 00:29:56,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:29:56,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 00:29:56,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816766997] [2020-11-30 00:29:56,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:29:56,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:29:56,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:29:56,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:29:56,155 INFO L87 Difference]: Start difference. First operand 547 states and 1424 transitions. Second operand 7 states. [2020-11-30 00:29:56,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:29:56,278 INFO L93 Difference]: Finished difference Result 522 states and 1374 transitions. [2020-11-30 00:29:56,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:29:56,279 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-11-30 00:29:56,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:29:56,281 INFO L225 Difference]: With dead ends: 522 [2020-11-30 00:29:56,281 INFO L226 Difference]: Without dead ends: 201 [2020-11-30 00:29:56,281 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:29:56,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-11-30 00:29:56,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 179. [2020-11-30 00:29:56,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-11-30 00:29:56,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 445 transitions. [2020-11-30 00:29:56,289 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 445 transitions. Word has length 21 [2020-11-30 00:29:56,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:29:56,290 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 445 transitions. [2020-11-30 00:29:56,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:29:56,290 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 445 transitions. [2020-11-30 00:29:56,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-30 00:29:56,291 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:29:56,292 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] [2020-11-30 00:29:56,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 00:29:56,292 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:29:56,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:29:56,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1627508946, now seen corresponding path program 1 times [2020-11-30 00:29:56,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:29:56,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869100489] [2020-11-30 00:29:56,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:29:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:29:56,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:29:56,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869100489] [2020-11-30 00:29:56,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:29:56,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:29:56,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563229210] [2020-11-30 00:29:56,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:29:56,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:29:56,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:29:56,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:29:56,554 INFO L87 Difference]: Start difference. First operand 179 states and 445 transitions. Second operand 7 states. [2020-11-30 00:29:56,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:29:56,742 INFO L93 Difference]: Finished difference Result 241 states and 589 transitions. [2020-11-30 00:29:56,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:29:56,743 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-11-30 00:29:56,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:29:56,744 INFO L225 Difference]: With dead ends: 241 [2020-11-30 00:29:56,744 INFO L226 Difference]: Without dead ends: 139 [2020-11-30 00:29:56,745 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-11-30 00:29:56,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-11-30 00:29:56,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2020-11-30 00:29:56,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-11-30 00:29:56,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 317 transitions. [2020-11-30 00:29:56,750 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 317 transitions. Word has length 25 [2020-11-30 00:29:56,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:29:56,750 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 317 transitions. [2020-11-30 00:29:56,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:29:56,750 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 317 transitions. [2020-11-30 00:29:56,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-30 00:29:56,751 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:29:56,751 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] [2020-11-30 00:29:56,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 00:29:56,751 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:29:56,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:29:56,752 INFO L82 PathProgramCache]: Analyzing trace with hash 91777140, now seen corresponding path program 2 times [2020-11-30 00:29:56,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:29:56,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948632891] [2020-11-30 00:29:56,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:29:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:29:56,811 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:29:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:29:56,857 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:29:56,925 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:29:56,925 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 00:29:56,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 00:29:56,927 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-11-30 00:29:56,947 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L847-->L854: Formula: (let ((.cse7 (= (mod ~z$r_buff0_thd0~0_In-1839969063 256) 0)) (.cse6 (= (mod ~z$w_buff0_used~0_In-1839969063 256) 0)) (.cse9 (= (mod ~z$w_buff1_used~0_In-1839969063 256) 0)) (.cse8 (= (mod ~z$r_buff1_thd0~0_In-1839969063 256) 0))) (let ((.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse3 (not .cse6)) (.cse4 (not .cse7)) (.cse5 (or .cse6 .cse7))) (and (= ~z$r_buff0_thd0~0_In-1839969063 ~z$r_buff0_thd0~0_Out-1839969063) (or (and .cse0 (= ~z$w_buff1_used~0_Out-1839969063 0) .cse1) (and .cse2 (= ~z$w_buff1_used~0_In-1839969063 ~z$w_buff1_used~0_Out-1839969063))) (or (and .cse3 (= ~z~0_Out-1839969063 ~z$w_buff0~0_In-1839969063) .cse4) (and (or (and .cse2 (= ~z~0_Out-1839969063 ~z~0_In-1839969063)) (and (= ~z~0_Out-1839969063 ~z$w_buff1~0_In-1839969063) .cse0 .cse1)) .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1839969063 0)) (= ~z$r_buff1_thd0~0_Out-1839969063 ~z$r_buff1_thd0~0_In-1839969063) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1839969063 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1839969063|) (or (and .cse3 (= ~z$w_buff0_used~0_Out-1839969063 0) .cse4) (and .cse5 (= ~z$w_buff0_used~0_Out-1839969063 ~z$w_buff0_used~0_In-1839969063)))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1839969063|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1839969063, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1839969063, ~z$w_buff0~0=~z$w_buff0~0_In-1839969063, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1839969063, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1839969063, ~z$w_buff1~0=~z$w_buff1~0_In-1839969063, ~z~0=~z~0_In-1839969063} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1839969063, ~z$w_buff0~0=~z$w_buff0~0_In-1839969063, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1839969063, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1839969063|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1839969063|, ~z$w_buff1~0=~z$w_buff1~0_In-1839969063, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1839969063|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1839969063|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1839969063|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1839969063|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1839969063|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-1839969063, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1839969063, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1839969063, ~z~0=~z~0_Out-1839969063} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ~z~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-11-30 00:29:56,958 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:56,958 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [797] [2020-11-30 00:29:56,960 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:56,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:56,960 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:56,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:56,960 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:56,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:56,961 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:56,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:56,961 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:56,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:56,963 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:56,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:56,963 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:56,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:56,963 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:56,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:56,963 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:56,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:56,964 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:56,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:56,965 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:56,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:56,965 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:56,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:56,965 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:56,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:56,965 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:56,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:56,966 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:56,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:56,971 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:56,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:56,972 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:56,972 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:56,972 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:56,972 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:56,973 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:56,973 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:56,973 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:56,973 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:56,973 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:56,973 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:56,973 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:56,974 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:56,974 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:56,974 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:56,974 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:56,974 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:57,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 12:29:57 BasicIcfg [2020-11-30 00:29:57,078 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 00:29:57,079 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:29:57,079 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:29:57,079 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:29:57,081 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:29:39" (3/4) ... [2020-11-30 00:29:57,083 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 00:29:57,096 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L847-->L854: Formula: (let ((.cse7 (= (mod ~z$r_buff0_thd0~0_In-1839969063 256) 0)) (.cse6 (= (mod ~z$w_buff0_used~0_In-1839969063 256) 0)) (.cse9 (= (mod ~z$w_buff1_used~0_In-1839969063 256) 0)) (.cse8 (= (mod ~z$r_buff1_thd0~0_In-1839969063 256) 0))) (let ((.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse3 (not .cse6)) (.cse4 (not .cse7)) (.cse5 (or .cse6 .cse7))) (and (= ~z$r_buff0_thd0~0_In-1839969063 ~z$r_buff0_thd0~0_Out-1839969063) (or (and .cse0 (= ~z$w_buff1_used~0_Out-1839969063 0) .cse1) (and .cse2 (= ~z$w_buff1_used~0_In-1839969063 ~z$w_buff1_used~0_Out-1839969063))) (or (and .cse3 (= ~z~0_Out-1839969063 ~z$w_buff0~0_In-1839969063) .cse4) (and (or (and .cse2 (= ~z~0_Out-1839969063 ~z~0_In-1839969063)) (and (= ~z~0_Out-1839969063 ~z$w_buff1~0_In-1839969063) .cse0 .cse1)) .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1839969063 0)) (= ~z$r_buff1_thd0~0_Out-1839969063 ~z$r_buff1_thd0~0_In-1839969063) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1839969063 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1839969063|) (or (and .cse3 (= ~z$w_buff0_used~0_Out-1839969063 0) .cse4) (and .cse5 (= ~z$w_buff0_used~0_Out-1839969063 ~z$w_buff0_used~0_In-1839969063)))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1839969063|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1839969063, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1839969063, ~z$w_buff0~0=~z$w_buff0~0_In-1839969063, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1839969063, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1839969063, ~z$w_buff1~0=~z$w_buff1~0_In-1839969063, ~z~0=~z~0_In-1839969063} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1839969063, ~z$w_buff0~0=~z$w_buff0~0_In-1839969063, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1839969063, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1839969063|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1839969063|, ~z$w_buff1~0=~z$w_buff1~0_In-1839969063, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1839969063|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1839969063|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1839969063|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1839969063|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1839969063|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-1839969063, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1839969063, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1839969063, ~z~0=~z~0_Out-1839969063} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ~z~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-11-30 00:29:57,099 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:57,099 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [797] [2020-11-30 00:29:57,100 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:57,100 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:57,100 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:57,100 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:57,100 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:57,101 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:57,101 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:57,101 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:57,101 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:57,101 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:57,101 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:57,101 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:57,101 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:57,101 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:57,102 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:57,102 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:57,102 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:57,102 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:57,102 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:57,102 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:57,102 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:57,103 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:57,103 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:57,103 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:57,103 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:57,103 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:57,103 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:57,103 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:57,103 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:57,103 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:57,103 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:57,104 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:57,104 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:57,104 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:57,104 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:57,104 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:57,104 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:57,104 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:57,104 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:57,104 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:57,105 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:57,105 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:57,105 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:57,105 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:57,105 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:57,105 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:57,105 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:29:57,105 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:29:57,261 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3710bb61-4be8-4dbc-80d7-decaf2c679bd/bin/uautomizer/witness.graphml [2020-11-30 00:29:57,261 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:29:57,262 INFO L168 Benchmark]: Toolchain (without parser) took 21647.61 ms. Allocated memory was 83.9 MB in the beginning and 287.3 MB in the end (delta: 203.4 MB). Free memory was 50.9 MB in the beginning and 149.6 MB in the end (delta: -98.7 MB). Peak memory consumption was 105.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:29:57,263 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 83.9 MB. Free memory was 41.6 MB in the beginning and 41.5 MB in the end (delta: 39.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:29:57,263 INFO L168 Benchmark]: CACSL2BoogieTranslator took 772.58 ms. Allocated memory is still 83.9 MB. Free memory was 50.8 MB in the beginning and 35.6 MB in the end (delta: 15.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-30 00:29:57,263 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.53 ms. Allocated memory was 83.9 MB in the beginning and 111.1 MB in the end (delta: 27.3 MB). Free memory was 35.6 MB in the beginning and 88.0 MB in the end (delta: -52.4 MB). Peak memory consumption was 5.7 MB. Max. memory is 16.1 GB. [2020-11-30 00:29:57,264 INFO L168 Benchmark]: Boogie Preprocessor took 79.05 ms. Allocated memory is still 111.1 MB. Free memory was 88.0 MB in the beginning and 86.8 MB in the end (delta: 1.2 MB). Peak memory consumption was 4.6 MB. Max. memory is 16.1 GB. [2020-11-30 00:29:57,264 INFO L168 Benchmark]: RCFGBuilder took 3043.26 ms. Allocated memory was 111.1 MB in the beginning and 134.2 MB in the end (delta: 23.1 MB). Free memory was 86.8 MB in the beginning and 56.0 MB in the end (delta: 30.8 MB). Peak memory consumption was 59.5 MB. Max. memory is 16.1 GB. [2020-11-30 00:29:57,264 INFO L168 Benchmark]: TraceAbstraction took 17456.21 ms. Allocated memory was 134.2 MB in the beginning and 287.3 MB in the end (delta: 153.1 MB). Free memory was 56.0 MB in the beginning and 168.5 MB in the end (delta: -112.5 MB). Peak memory consumption was 40.6 MB. Max. memory is 16.1 GB. [2020-11-30 00:29:57,265 INFO L168 Benchmark]: Witness Printer took 182.61 ms. Allocated memory is still 287.3 MB. Free memory was 168.5 MB in the beginning and 149.6 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-30 00:29:57,267 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 83.9 MB. Free memory was 41.6 MB in the beginning and 41.5 MB in the end (delta: 39.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 772.58 ms. Allocated memory is still 83.9 MB. Free memory was 50.8 MB in the beginning and 35.6 MB in the end (delta: 15.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 106.53 ms. Allocated memory was 83.9 MB in the beginning and 111.1 MB in the end (delta: 27.3 MB). Free memory was 35.6 MB in the beginning and 88.0 MB in the end (delta: -52.4 MB). Peak memory consumption was 5.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 79.05 ms. Allocated memory is still 111.1 MB. Free memory was 88.0 MB in the beginning and 86.8 MB in the end (delta: 1.2 MB). Peak memory consumption was 4.6 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3043.26 ms. Allocated memory was 111.1 MB in the beginning and 134.2 MB in the end (delta: 23.1 MB). Free memory was 86.8 MB in the beginning and 56.0 MB in the end (delta: 30.8 MB). Peak memory consumption was 59.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 17456.21 ms. Allocated memory was 134.2 MB in the beginning and 287.3 MB in the end (delta: 153.1 MB). Free memory was 56.0 MB in the beginning and 168.5 MB in the end (delta: -112.5 MB). Peak memory consumption was 40.6 MB. Max. memory is 16.1 GB. * Witness Printer took 182.61 ms. Allocated memory is still 287.3 MB. Free memory was 168.5 MB in the beginning and 149.6 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1746 VarBasedMoverChecksPositive, 68 VarBasedMoverChecksNegative, 14 SemBasedMoverChecksPositive, 54 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 198 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 12.5s, 127 PlacesBefore, 44 PlacesAfterwards, 117 TransitionsBefore, 31 TransitionsAfterwards, 2622 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 105 TotalNumberOfCompositions, 6769 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_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1477; [L837] FCALL, FORK 0 pthread_create(&t1477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1478; [L839] FCALL, FORK 0 pthread_create(&t1478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1479; [L841] FCALL, FORK 0 pthread_create(&t1479, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t1480; [L843] FCALL, FORK 0 pthread_create(&t1480, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L763] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L778] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L814] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L816] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L818] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 4 return 0; [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L860] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0 [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L861] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L865] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L865] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L866] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L866] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L866] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix055_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 115 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.1s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.8s, HoareTripleCheckerStatistics: 322 SDtfs, 408 SDslu, 527 SDs, 0 SdLazy, 255 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2602occurred 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: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 63 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 204 NumberOfCodeBlocks, 204 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 168 ConstructedInterpolants, 0 QuantifiedInterpolants, 18180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...