./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix010_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7e93e9e9-44c7-4061-9077-eb067ceb11e0/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_7e93e9e9-44c7-4061-9077-eb067ceb11e0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7e93e9e9-44c7-4061-9077-eb067ceb11e0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7e93e9e9-44c7-4061-9077-eb067ceb11e0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix010_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7e93e9e9-44c7-4061-9077-eb067ceb11e0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7e93e9e9-44c7-4061-9077-eb067ceb11e0/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 5d4c0d9791ce76ffdd065ec2e3badf76122741f6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-28 02:56:34,104 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 02:56:34,106 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 02:56:34,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 02:56:34,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 02:56:34,193 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 02:56:34,196 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 02:56:34,204 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 02:56:34,206 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 02:56:34,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 02:56:34,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 02:56:34,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 02:56:34,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 02:56:34,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 02:56:34,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 02:56:34,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 02:56:34,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 02:56:34,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 02:56:34,233 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 02:56:34,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 02:56:34,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 02:56:34,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 02:56:34,245 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 02:56:34,246 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 02:56:34,252 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 02:56:34,252 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 02:56:34,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 02:56:34,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 02:56:34,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 02:56:34,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 02:56:34,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 02:56:34,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 02:56:34,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 02:56:34,261 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 02:56:34,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 02:56:34,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 02:56:34,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 02:56:34,264 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 02:56:34,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 02:56:34,265 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 02:56:34,267 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 02:56:34,269 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7e93e9e9-44c7-4061-9077-eb067ceb11e0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 02:56:34,305 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 02:56:34,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 02:56:34,312 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 02:56:34,312 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 02:56:34,312 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 02:56:34,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 02:56:34,313 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 02:56:34,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 02:56:34,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 02:56:34,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 02:56:34,314 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 02:56:34,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 02:56:34,315 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 02:56:34,315 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 02:56:34,315 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 02:56:34,316 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 02:56:34,316 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 02:56:34,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 02:56:34,316 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 02:56:34,317 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 02:56:34,317 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 02:56:34,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 02:56:34,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 02:56:34,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 02:56:34,318 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 02:56:34,318 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 02:56:34,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 02:56:34,318 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 02:56:34,319 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 02:56:34,319 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_7e93e9e9-44c7-4061-9077-eb067ceb11e0/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_7e93e9e9-44c7-4061-9077-eb067ceb11e0/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 -> 5d4c0d9791ce76ffdd065ec2e3badf76122741f6 [2020-11-28 02:56:34,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 02:56:34,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 02:56:34,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 02:56:34,685 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 02:56:34,686 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 02:56:34,687 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7e93e9e9-44c7-4061-9077-eb067ceb11e0/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix010_power.oepc.i [2020-11-28 02:56:34,769 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7e93e9e9-44c7-4061-9077-eb067ceb11e0/bin/uautomizer/data/e9a86a885/f3bb572d8e7b405da9b65a30c07c3ba9/FLAG55ea6b12f [2020-11-28 02:56:35,381 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 02:56:35,382 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7e93e9e9-44c7-4061-9077-eb067ceb11e0/sv-benchmarks/c/pthread-wmm/mix010_power.oepc.i [2020-11-28 02:56:35,418 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7e93e9e9-44c7-4061-9077-eb067ceb11e0/bin/uautomizer/data/e9a86a885/f3bb572d8e7b405da9b65a30c07c3ba9/FLAG55ea6b12f [2020-11-28 02:56:35,663 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7e93e9e9-44c7-4061-9077-eb067ceb11e0/bin/uautomizer/data/e9a86a885/f3bb572d8e7b405da9b65a30c07c3ba9 [2020-11-28 02:56:35,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 02:56:35,668 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 02:56:35,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 02:56:35,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 02:56:35,677 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 02:56:35,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:56:35" (1/1) ... [2020-11-28 02:56:35,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@157c993e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:35, skipping insertion in model container [2020-11-28 02:56:35,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:56:35" (1/1) ... [2020-11-28 02:56:35,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 02:56:35,759 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 02:56:36,156 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 02:56:36,165 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 02:56:36,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 02:56:36,353 INFO L208 MainTranslator]: Completed translation [2020-11-28 02:56:36,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:36 WrapperNode [2020-11-28 02:56:36,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 02:56:36,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 02:56:36,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 02:56:36,356 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 02:56:36,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:36" (1/1) ... [2020-11-28 02:56:36,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:36" (1/1) ... [2020-11-28 02:56:36,422 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 02:56:36,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 02:56:36,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 02:56:36,423 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 02:56:36,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:36" (1/1) ... [2020-11-28 02:56:36,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:36" (1/1) ... [2020-11-28 02:56:36,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:36" (1/1) ... [2020-11-28 02:56:36,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:36" (1/1) ... [2020-11-28 02:56:36,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:36" (1/1) ... [2020-11-28 02:56:36,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:36" (1/1) ... [2020-11-28 02:56:36,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:36" (1/1) ... [2020-11-28 02:56:36,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 02:56:36,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 02:56:36,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 02:56:36,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 02:56:36,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7e93e9e9-44c7-4061-9077-eb067ceb11e0/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 02:56:36,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 02:56:36,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-28 02:56:36,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 02:56:36,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 02:56:36,554 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-28 02:56:36,554 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-28 02:56:36,554 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-28 02:56:36,554 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-28 02:56:36,554 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-28 02:56:36,555 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-28 02:56:36,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 02:56:36,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-28 02:56:36,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 02:56:36,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 02:56:36,557 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-28 02:56:39,204 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 02:56:39,204 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-28 02:56:39,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:56:39 BoogieIcfgContainer [2020-11-28 02:56:39,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 02:56:39,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 02:56:39,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 02:56:39,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 02:56:39,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:56:35" (1/3) ... [2020-11-28 02:56:39,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6095e1b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:56:39, skipping insertion in model container [2020-11-28 02:56:39,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:36" (2/3) ... [2020-11-28 02:56:39,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6095e1b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:56:39, skipping insertion in model container [2020-11-28 02:56:39,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:56:39" (3/3) ... [2020-11-28 02:56:39,214 INFO L111 eAbstractionObserver]: Analyzing ICFG mix010_power.oepc.i [2020-11-28 02:56:39,224 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-28 02:56:39,225 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 02:56:39,229 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-28 02:56:39,230 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-28 02:56:39,265 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,266 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,266 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,266 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,267 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,268 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,271 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,272 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,275 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,275 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,280 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,280 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,280 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,280 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,280 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,282 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,282 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,284 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,284 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,290 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,292 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,299 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,300 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,301 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,306 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,307 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,310 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-28 02:56:39,321 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-28 02:56:39,347 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 02:56:39,348 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 02:56:39,348 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 02:56:39,348 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 02:56:39,348 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 02:56:39,348 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 02:56:39,348 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 02:56:39,348 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 02:56:39,364 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-28 02:56:39,366 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 109 transitions, 233 flow [2020-11-28 02:56:39,369 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 109 transitions, 233 flow [2020-11-28 02:56:39,371 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 116 places, 109 transitions, 233 flow [2020-11-28 02:56:39,434 INFO L129 PetriNetUnfolder]: 3/106 cut-off events. [2020-11-28 02:56:39,434 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-28 02:56:39,440 INFO L80 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 3/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2020-11-28 02:56:39,446 INFO L116 LiptonReduction]: Number of co-enabled transitions 2166 [2020-11-28 02:56:39,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:39,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:39,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:39,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:39,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:39,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:39,593 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:39,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:39,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:39,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:39,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:39,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:39,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:39,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:39,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:39,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:39,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:39,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:39,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:56:39,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:39,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:39,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:39,869 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:56:39,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:39,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 02:56:39,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:39,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:39,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:39,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:39,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:39,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:39,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 02:56:39,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 02:56:39,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:39,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:39,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:39,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:39,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:39,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:39,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:39,987 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:39,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:40,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:40,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:40,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:40,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:40,327 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-11-28 02:56:40,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:40,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 02:56:40,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 02:56:40,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:40,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:56:40,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:40,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:40,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:40,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:56:40,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:40,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 02:56:40,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:40,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:40,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:40,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:40,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:40,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:40,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:40,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:40,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:40,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:40,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:40,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:40,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:40,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:40,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:40,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:40,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:40,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:41,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:41,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:41,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:41,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:41,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:41,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:41,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:41,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:41,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:41,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:41,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:41,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:41,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:41,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:41,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:41,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:41,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:41,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:41,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:41,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:41,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:41,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:41,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:41,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:41,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:41,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:41,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:41,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:41,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:41,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:41,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:41,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:41,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:41,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:41,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:41,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:42,168 WARN L193 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-28 02:56:42,283 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-28 02:56:42,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 02:56:42,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:42,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:42,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:42,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:42,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:42,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:42,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:56:42,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:42,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:42,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:42,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:56:42,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:42,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 02:56:42,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:42,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:42,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:42,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:42,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:42,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:42,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-28 02:56:42,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 02:56:42,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:42,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-28 02:56:42,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 02:56:42,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:56:42,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:42,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:42,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:42,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:56:42,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:42,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 02:56:42,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:42,923 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:42,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:42,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:42,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:43,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:43,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:43,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:43,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:43,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:43,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:43,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:43,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:43,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:43,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:43,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:43,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:43,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:43,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:43,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:43,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:43,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:43,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:43,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:43,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:43,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:43,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:43,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:43,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:43,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:43,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:43,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:43,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:43,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:43,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:43,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:43,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:43,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:43,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:43,695 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-11-28 02:56:44,177 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-11-28 02:56:44,299 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-11-28 02:56:44,839 WARN L193 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-11-28 02:56:45,035 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-11-28 02:56:45,041 INFO L131 LiptonReduction]: Checked pairs total: 6565 [2020-11-28 02:56:45,042 INFO L133 LiptonReduction]: Total number of compositions: 95 [2020-11-28 02:56:45,047 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 30 transitions, 75 flow [2020-11-28 02:56:45,128 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1382 states. [2020-11-28 02:56:45,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states. [2020-11-28 02:56:45,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-28 02:56:45,134 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:45,134 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-28 02:56:45,135 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:45,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:45,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1116028, now seen corresponding path program 1 times [2020-11-28 02:56:45,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:45,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571081797] [2020-11-28 02:56:45,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:45,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:45,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571081797] [2020-11-28 02:56:45,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:45,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 02:56:45,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034404301] [2020-11-28 02:56:45,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:56:45,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:45,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:56:45,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:56:45,379 INFO L87 Difference]: Start difference. First operand 1382 states. Second operand 3 states. [2020-11-28 02:56:45,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:45,534 INFO L93 Difference]: Finished difference Result 1152 states and 3742 transitions. [2020-11-28 02:56:45,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:56:45,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-11-28 02:56:45,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:45,580 INFO L225 Difference]: With dead ends: 1152 [2020-11-28 02:56:45,580 INFO L226 Difference]: Without dead ends: 972 [2020-11-28 02:56:45,581 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:56:45,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2020-11-28 02:56:45,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 972. [2020-11-28 02:56:45,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2020-11-28 02:56:45,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 3118 transitions. [2020-11-28 02:56:45,717 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 3118 transitions. Word has length 3 [2020-11-28 02:56:45,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:45,717 INFO L481 AbstractCegarLoop]: Abstraction has 972 states and 3118 transitions. [2020-11-28 02:56:45,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:56:45,718 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 3118 transitions. [2020-11-28 02:56:45,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-28 02:56:45,720 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:45,720 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:45,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 02:56:45,720 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:45,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:45,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1840733593, now seen corresponding path program 1 times [2020-11-28 02:56:45,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:45,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133560785] [2020-11-28 02:56:45,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:45,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:45,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133560785] [2020-11-28 02:56:45,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:45,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 02:56:45,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929865495] [2020-11-28 02:56:45,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:56:45,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:45,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:56:45,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:56:45,856 INFO L87 Difference]: Start difference. First operand 972 states and 3118 transitions. Second operand 4 states. [2020-11-28 02:56:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:45,889 INFO L93 Difference]: Finished difference Result 1032 states and 3186 transitions. [2020-11-28 02:56:45,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:56:45,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-28 02:56:45,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:45,899 INFO L225 Difference]: With dead ends: 1032 [2020-11-28 02:56:45,899 INFO L226 Difference]: Without dead ends: 852 [2020-11-28 02:56:45,900 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:56:45,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2020-11-28 02:56:45,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 852. [2020-11-28 02:56:45,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2020-11-28 02:56:45,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 2682 transitions. [2020-11-28 02:56:45,936 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 2682 transitions. Word has length 10 [2020-11-28 02:56:45,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:45,937 INFO L481 AbstractCegarLoop]: Abstraction has 852 states and 2682 transitions. [2020-11-28 02:56:45,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:56:45,937 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 2682 transitions. [2020-11-28 02:56:45,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-28 02:56:45,940 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:45,940 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:45,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 02:56:45,940 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:45,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:45,941 INFO L82 PathProgramCache]: Analyzing trace with hash 428817719, now seen corresponding path program 1 times [2020-11-28 02:56:45,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:45,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363150008] [2020-11-28 02:56:45,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:46,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:46,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363150008] [2020-11-28 02:56:46,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:46,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 02:56:46,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740211786] [2020-11-28 02:56:46,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:56:46,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:46,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:56:46,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:56:46,080 INFO L87 Difference]: Start difference. First operand 852 states and 2682 transitions. Second operand 4 states. [2020-11-28 02:56:46,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:46,120 INFO L93 Difference]: Finished difference Result 892 states and 2724 transitions. [2020-11-28 02:56:46,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:56:46,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-28 02:56:46,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:46,128 INFO L225 Difference]: With dead ends: 892 [2020-11-28 02:56:46,128 INFO L226 Difference]: Without dead ends: 772 [2020-11-28 02:56:46,129 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:56:46,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2020-11-28 02:56:46,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2020-11-28 02:56:46,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-11-28 02:56:46,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 2398 transitions. [2020-11-28 02:56:46,158 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 2398 transitions. Word has length 12 [2020-11-28 02:56:46,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:46,158 INFO L481 AbstractCegarLoop]: Abstraction has 772 states and 2398 transitions. [2020-11-28 02:56:46,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:56:46,159 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 2398 transitions. [2020-11-28 02:56:46,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 02:56:46,164 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:46,164 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:46,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 02:56:46,164 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:46,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:46,165 INFO L82 PathProgramCache]: Analyzing trace with hash -224023144, now seen corresponding path program 1 times [2020-11-28 02:56:46,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:46,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487958540] [2020-11-28 02:56:46,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:46,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:46,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487958540] [2020-11-28 02:56:46,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:46,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:56:46,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866263360] [2020-11-28 02:56:46,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:56:46,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:46,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:56:46,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:56:46,279 INFO L87 Difference]: Start difference. First operand 772 states and 2398 transitions. Second operand 4 states. [2020-11-28 02:56:46,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:46,330 INFO L93 Difference]: Finished difference Result 680 states and 1854 transitions. [2020-11-28 02:56:46,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:56:46,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-28 02:56:46,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:46,334 INFO L225 Difference]: With dead ends: 680 [2020-11-28 02:56:46,334 INFO L226 Difference]: Without dead ends: 500 [2020-11-28 02:56:46,335 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:56:46,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2020-11-28 02:56:46,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2020-11-28 02:56:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2020-11-28 02:56:46,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1310 transitions. [2020-11-28 02:56:46,351 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1310 transitions. Word has length 14 [2020-11-28 02:56:46,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:46,352 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 1310 transitions. [2020-11-28 02:56:46,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:56:46,352 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1310 transitions. [2020-11-28 02:56:46,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-28 02:56:46,353 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:46,353 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:46,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 02:56:46,354 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:46,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:46,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1135596914, now seen corresponding path program 1 times [2020-11-28 02:56:46,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:46,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035212398] [2020-11-28 02:56:46,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:46,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:46,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035212398] [2020-11-28 02:56:46,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:46,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 02:56:46,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513377629] [2020-11-28 02:56:46,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 02:56:46,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:46,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 02:56:46,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:56:46,483 INFO L87 Difference]: Start difference. First operand 500 states and 1310 transitions. Second operand 5 states. [2020-11-28 02:56:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:46,553 INFO L93 Difference]: Finished difference Result 384 states and 931 transitions. [2020-11-28 02:56:46,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 02:56:46,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-11-28 02:56:46,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:46,558 INFO L225 Difference]: With dead ends: 384 [2020-11-28 02:56:46,558 INFO L226 Difference]: Without dead ends: 304 [2020-11-28 02:56:46,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 02:56:46,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-11-28 02:56:46,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2020-11-28 02:56:46,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-11-28 02:56:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 722 transitions. [2020-11-28 02:56:46,568 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 722 transitions. Word has length 17 [2020-11-28 02:56:46,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:46,569 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 722 transitions. [2020-11-28 02:56:46,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 02:56:46,569 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 722 transitions. [2020-11-28 02:56:46,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-28 02:56:46,570 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:46,570 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:46,571 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 02:56:46,571 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:46,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:46,571 INFO L82 PathProgramCache]: Analyzing trace with hash -26850630, now seen corresponding path program 1 times [2020-11-28 02:56:46,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:46,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322221185] [2020-11-28 02:56:46,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:46,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:46,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322221185] [2020-11-28 02:56:46,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:46,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 02:56:46,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886995924] [2020-11-28 02:56:46,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 02:56:46,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:46,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 02:56:46,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 02:56:46,811 INFO L87 Difference]: Start difference. First operand 304 states and 722 transitions. Second operand 6 states. [2020-11-28 02:56:46,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:46,884 INFO L93 Difference]: Finished difference Result 271 states and 654 transitions. [2020-11-28 02:56:46,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 02:56:46,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-11-28 02:56:46,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:46,887 INFO L225 Difference]: With dead ends: 271 [2020-11-28 02:56:46,888 INFO L226 Difference]: Without dead ends: 256 [2020-11-28 02:56:46,888 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-28 02:56:46,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-11-28 02:56:46,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2020-11-28 02:56:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-11-28 02:56:46,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 626 transitions. [2020-11-28 02:56:46,898 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 626 transitions. Word has length 20 [2020-11-28 02:56:46,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:46,898 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 626 transitions. [2020-11-28 02:56:46,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 02:56:46,898 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 626 transitions. [2020-11-28 02:56:46,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-28 02:56:46,900 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:46,900 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:46,900 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 02:56:46,900 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:46,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:46,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1733561812, now seen corresponding path program 1 times [2020-11-28 02:56:46,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:46,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905238423] [2020-11-28 02:56:46,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:47,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:47,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905238423] [2020-11-28 02:56:47,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:47,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 02:56:47,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301193025] [2020-11-28 02:56:47,052 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 02:56:47,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:47,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 02:56:47,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:56:47,053 INFO L87 Difference]: Start difference. First operand 256 states and 626 transitions. Second operand 5 states. [2020-11-28 02:56:47,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:47,096 INFO L93 Difference]: Finished difference Result 379 states and 910 transitions. [2020-11-28 02:56:47,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:56:47,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-11-28 02:56:47,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:47,098 INFO L225 Difference]: With dead ends: 379 [2020-11-28 02:56:47,099 INFO L226 Difference]: Without dead ends: 176 [2020-11-28 02:56:47,099 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 02:56:47,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-11-28 02:56:47,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2020-11-28 02:56:47,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-11-28 02:56:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 396 transitions. [2020-11-28 02:56:47,106 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 396 transitions. Word has length 24 [2020-11-28 02:56:47,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:47,106 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 396 transitions. [2020-11-28 02:56:47,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 02:56:47,106 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 396 transitions. [2020-11-28 02:56:47,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-28 02:56:47,107 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:47,107 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:47,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 02:56:47,108 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:47,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:47,108 INFO L82 PathProgramCache]: Analyzing trace with hash -4882518, now seen corresponding path program 2 times [2020-11-28 02:56:47,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:47,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314727426] [2020-11-28 02:56:47,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:47,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:47,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314727426] [2020-11-28 02:56:47,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:47,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 02:56:47,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530937510] [2020-11-28 02:56:47,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 02:56:47,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:47,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 02:56:47,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:56:47,201 INFO L87 Difference]: Start difference. First operand 176 states and 396 transitions. Second operand 5 states. [2020-11-28 02:56:47,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:47,240 INFO L93 Difference]: Finished difference Result 224 states and 495 transitions. [2020-11-28 02:56:47,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:56:47,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-11-28 02:56:47,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:47,242 INFO L225 Difference]: With dead ends: 224 [2020-11-28 02:56:47,242 INFO L226 Difference]: Without dead ends: 121 [2020-11-28 02:56:47,242 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 02:56:47,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-11-28 02:56:47,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2020-11-28 02:56:47,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-11-28 02:56:47,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 256 transitions. [2020-11-28 02:56:47,247 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 256 transitions. Word has length 24 [2020-11-28 02:56:47,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:47,247 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 256 transitions. [2020-11-28 02:56:47,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 02:56:47,247 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 256 transitions. [2020-11-28 02:56:47,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-28 02:56:47,248 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:47,248 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:47,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 02:56:47,249 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:47,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:47,249 INFO L82 PathProgramCache]: Analyzing trace with hash 2048889948, now seen corresponding path program 3 times [2020-11-28 02:56:47,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:47,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774263318] [2020-11-28 02:56:47,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:47,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:47,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774263318] [2020-11-28 02:56:47,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:47,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 02:56:47,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939170389] [2020-11-28 02:56:47,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-28 02:56:47,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:47,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-28 02:56:47,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-28 02:56:47,533 INFO L87 Difference]: Start difference. First operand 121 states and 256 transitions. Second operand 8 states. [2020-11-28 02:56:47,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:47,717 INFO L93 Difference]: Finished difference Result 142 states and 292 transitions. [2020-11-28 02:56:47,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 02:56:47,718 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-11-28 02:56:47,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:47,718 INFO L225 Difference]: With dead ends: 142 [2020-11-28 02:56:47,719 INFO L226 Difference]: Without dead ends: 69 [2020-11-28 02:56:47,719 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-28 02:56:47,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-11-28 02:56:47,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-11-28 02:56:47,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-28 02:56:47,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 120 transitions. [2020-11-28 02:56:47,721 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 120 transitions. Word has length 24 [2020-11-28 02:56:47,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:47,722 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 120 transitions. [2020-11-28 02:56:47,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-28 02:56:47,722 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 120 transitions. [2020-11-28 02:56:47,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-28 02:56:47,722 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:47,723 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:47,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 02:56:47,723 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:47,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:47,723 INFO L82 PathProgramCache]: Analyzing trace with hash 572828950, now seen corresponding path program 4 times [2020-11-28 02:56:47,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:47,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400568872] [2020-11-28 02:56:47,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:56:47,818 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:56:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:56:47,908 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:56:47,966 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:56:47,967 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 02:56:47,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 02:56:48,019 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,020 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,020 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,021 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [750] [2020-11-28 02:56:48,023 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,023 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,024 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,024 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,024 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,024 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,024 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,024 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,025 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,025 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,026 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,026 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,026 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,027 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,027 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,027 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,027 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,027 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,027 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,028 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,028 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,028 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,028 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,028 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,028 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,029 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,029 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,029 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,033 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,034 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,034 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,034 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,034 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,034 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,035 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,035 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,035 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,035 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,035 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,035 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,036 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,036 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,036 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,036 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,037 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,037 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,037 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,037 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,037 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,038 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,038 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,038 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,038 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,038 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,038 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,038 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,039 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,040 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,040 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,040 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,041 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,041 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,041 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,042 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,042 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:56:48 BasicIcfg [2020-11-28 02:56:48,140 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 02:56:48,141 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 02:56:48,141 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 02:56:48,141 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 02:56:48,142 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:56:39" (3/4) ... [2020-11-28 02:56:48,144 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 02:56:48,164 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,164 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,164 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,164 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [750] [2020-11-28 02:56:48,165 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,165 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,165 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,165 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,165 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,165 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,166 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,166 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,166 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,166 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,166 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,166 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,167 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,167 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,167 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,167 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,167 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,167 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,167 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,167 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,168 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,168 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,168 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,168 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,168 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,168 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,168 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,169 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,169 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,169 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,169 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,169 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,169 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,169 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,170 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,170 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,170 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,170 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,170 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,170 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,170 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,170 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,171 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,171 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,171 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,171 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,171 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,171 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,171 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,171 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,172 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,172 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,172 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,172 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,172 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,172 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,172 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,172 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,173 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,173 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,173 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,173 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,173 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,173 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,174 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,174 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,174 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,174 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,174 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:48,174 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:48,305 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7e93e9e9-44c7-4061-9077-eb067ceb11e0/bin/uautomizer/witness.graphml [2020-11-28 02:56:48,305 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 02:56:48,306 INFO L168 Benchmark]: Toolchain (without parser) took 12638.14 ms. Allocated memory was 100.7 MB in the beginning and 272.6 MB in the end (delta: 172.0 MB). Free memory was 65.5 MB in the beginning and 207.1 MB in the end (delta: -141.6 MB). Peak memory consumption was 28.8 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:48,307 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 100.7 MB. Free memory was 73.4 MB in the beginning and 73.4 MB in the end (delta: 31.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 02:56:48,307 INFO L168 Benchmark]: CACSL2BoogieTranslator took 682.02 ms. Allocated memory is still 100.7 MB. Free memory was 65.3 MB in the beginning and 53.5 MB in the end (delta: 11.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:48,307 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.58 ms. Allocated memory is still 100.7 MB. Free memory was 53.5 MB in the beginning and 51.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:48,308 INFO L168 Benchmark]: Boogie Preprocessor took 44.75 ms. Allocated memory is still 100.7 MB. Free memory was 51.0 MB in the beginning and 48.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:48,308 INFO L168 Benchmark]: RCFGBuilder took 2737.34 ms. Allocated memory was 100.7 MB in the beginning and 136.3 MB in the end (delta: 35.7 MB). Free memory was 48.9 MB in the beginning and 75.3 MB in the end (delta: -26.4 MB). Peak memory consumption was 45.7 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:48,309 INFO L168 Benchmark]: TraceAbstraction took 8933.05 ms. Allocated memory was 136.3 MB in the beginning and 272.6 MB in the end (delta: 136.3 MB). Free memory was 74.3 MB in the beginning and 229.1 MB in the end (delta: -154.8 MB). Peak memory consumption was 129.3 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:48,309 INFO L168 Benchmark]: Witness Printer took 164.16 ms. Allocated memory is still 272.6 MB. Free memory was 229.1 MB in the beginning and 207.1 MB in the end (delta: 22.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:48,313 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.20 ms. Allocated memory is still 100.7 MB. Free memory was 73.4 MB in the beginning and 73.4 MB in the end (delta: 31.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 682.02 ms. Allocated memory is still 100.7 MB. Free memory was 65.3 MB in the beginning and 53.5 MB in the end (delta: 11.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 66.58 ms. Allocated memory is still 100.7 MB. Free memory was 53.5 MB in the beginning and 51.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 44.75 ms. Allocated memory is still 100.7 MB. Free memory was 51.0 MB in the beginning and 48.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2737.34 ms. Allocated memory was 100.7 MB in the beginning and 136.3 MB in the end (delta: 35.7 MB). Free memory was 48.9 MB in the beginning and 75.3 MB in the end (delta: -26.4 MB). Peak memory consumption was 45.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 8933.05 ms. Allocated memory was 136.3 MB in the beginning and 272.6 MB in the end (delta: 136.3 MB). Free memory was 74.3 MB in the beginning and 229.1 MB in the end (delta: -154.8 MB). Peak memory consumption was 129.3 MB. Max. memory is 16.1 GB. * Witness Printer took 164.16 ms. Allocated memory is still 272.6 MB. Free memory was 229.1 MB in the beginning and 207.1 MB in the end (delta: 22.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1509 VarBasedMoverChecksPositive, 67 VarBasedMoverChecksNegative, 8 SemBasedMoverChecksPositive, 59 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 167 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.6s, 116 PlacesBefore, 39 PlacesAfterwards, 109 TransitionsBefore, 30 TransitionsAfterwards, 2166 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 95 TotalNumberOfCompositions, 6565 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool a$flush_delayed; [L723] 0 int a$mem_tmp; [L724] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$read_delayed; [L733] 0 int *a$read_delayed_var; [L734] 0 int a$w_buff0; [L735] 0 _Bool a$w_buff0_used; [L736] 0 int a$w_buff1; [L737] 0 _Bool a$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L850] 0 pthread_t t257; [L851] FCALL, FORK 0 pthread_create(&t257, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t258; [L853] FCALL, FORK 0 pthread_create(&t258, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L18] COND TRUE 1 !expression [L17] COND FALSE 1 !(0) [L17] 1 __assert_fail ("0", "mix010_power.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L854] 0 pthread_t t259; [L855] FCALL, FORK 0 pthread_create(&t259, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L763] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L780] 2 x = 1 [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, z=0] [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L806] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L809] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 a$flush_delayed = weak$$choice2 [L815] 3 a$mem_tmp = a [L816] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L816] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1 [L816] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L816] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L817] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L817] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0) [L817] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L817] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L818] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L818] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L819] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L819] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L820] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L820] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L821] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L822] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L822] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EBX = a [L824] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L824] 3 a = a$flush_delayed ? a$mem_tmp : a [L825] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L766] EXPR 1 a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L828] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L828] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L828] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L828] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L829] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L830] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L830] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L831] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L832] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L832] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L861] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L861] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L861] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L861] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L862] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L863] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L864] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L865] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix010_power.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 107 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.6s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 298 SDtfs, 319 SDslu, 599 SDs, 0 SdLazy, 181 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1382occurred 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.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 12011 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...