./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi000_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_85511e4e-bda3-4b1d-a41a-874e5cf9718c/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_85511e4e-bda3-4b1d-a41a-874e5cf9718c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_85511e4e-bda3-4b1d-a41a-874e5cf9718c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_85511e4e-bda3-4b1d-a41a-874e5cf9718c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi000_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_85511e4e-bda3-4b1d-a41a-874e5cf9718c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_85511e4e-bda3-4b1d-a41a-874e5cf9718c/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 785828885bdc7a6e840f746d82abc399ce755172 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 00:36:58,117 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:36:58,120 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:36:58,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:36:58,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:36:58,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:36:58,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:36:58,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:36:58,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:36:58,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:36:58,212 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:36:58,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:36:58,214 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:36:58,215 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:36:58,217 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:36:58,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:36:58,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:36:58,220 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:36:58,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:36:58,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:36:58,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:36:58,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:36:58,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:36:58,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:36:58,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:36:58,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:36:58,236 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:36:58,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:36:58,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:36:58,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:36:58,239 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:36:58,240 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:36:58,241 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:36:58,242 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:36:58,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:36:58,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:36:58,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:36:58,245 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:36:58,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:36:58,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:36:58,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:36:58,247 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_85511e4e-bda3-4b1d-a41a-874e5cf9718c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 00:36:58,270 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:36:58,270 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:36:58,271 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:36:58,271 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:36:58,272 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:36:58,272 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:36:58,272 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:36:58,272 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:36:58,273 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:36:58,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:36:58,273 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 00:36:58,273 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 00:36:58,273 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 00:36:58,274 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:36:58,274 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:36:58,274 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:36:58,274 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 00:36:58,275 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:36:58,275 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:36:58,275 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 00:36:58,275 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 00:36:58,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:36:58,276 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:36:58,276 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 00:36:58,276 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 00:36:58,276 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:36:58,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 00:36:58,277 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 00:36:58,277 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:36:58,277 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_85511e4e-bda3-4b1d-a41a-874e5cf9718c/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_85511e4e-bda3-4b1d-a41a-874e5cf9718c/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 -> 785828885bdc7a6e840f746d82abc399ce755172 [2020-11-30 00:36:58,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:36:58,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:36:58,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:36:58,544 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:36:58,546 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:36:58,547 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_85511e4e-bda3-4b1d-a41a-874e5cf9718c/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi000_power.opt.i [2020-11-30 00:36:58,622 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_85511e4e-bda3-4b1d-a41a-874e5cf9718c/bin/uautomizer/data/937594077/2ceb19e36b95424f88b46c5fc2c333b9/FLAG3b3dc9b18 [2020-11-30 00:36:59,239 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:36:59,239 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_85511e4e-bda3-4b1d-a41a-874e5cf9718c/sv-benchmarks/c/pthread-wmm/rfi000_power.opt.i [2020-11-30 00:36:59,278 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_85511e4e-bda3-4b1d-a41a-874e5cf9718c/bin/uautomizer/data/937594077/2ceb19e36b95424f88b46c5fc2c333b9/FLAG3b3dc9b18 [2020-11-30 00:36:59,537 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_85511e4e-bda3-4b1d-a41a-874e5cf9718c/bin/uautomizer/data/937594077/2ceb19e36b95424f88b46c5fc2c333b9 [2020-11-30 00:36:59,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:36:59,541 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:36:59,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:36:59,543 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:36:59,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:36:59,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:36:59" (1/1) ... [2020-11-30 00:36:59,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a58e127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:36:59, skipping insertion in model container [2020-11-30 00:36:59,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:36:59" (1/1) ... [2020-11-30 00:36:59,565 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:36:59,632 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:37:00,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:37:00,109 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:37:00,208 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:37:00,289 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:37:00,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:00 WrapperNode [2020-11-30 00:37:00,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:37:00,291 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:37:00,291 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:37:00,291 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:37:00,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:00" (1/1) ... [2020-11-30 00:37:00,330 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:00" (1/1) ... [2020-11-30 00:37:00,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:37:00,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:37:00,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:37:00,386 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:37:00,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:00" (1/1) ... [2020-11-30 00:37:00,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:00" (1/1) ... [2020-11-30 00:37:00,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:00" (1/1) ... [2020-11-30 00:37:00,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:00" (1/1) ... [2020-11-30 00:37:00,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:00" (1/1) ... [2020-11-30 00:37:00,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:00" (1/1) ... [2020-11-30 00:37:00,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:00" (1/1) ... [2020-11-30 00:37:00,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:37:00,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:37:00,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:37:00,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:37:00,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_85511e4e-bda3-4b1d-a41a-874e5cf9718c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:37:00,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 00:37:00,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-30 00:37:00,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:37:00,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 00:37:00,564 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-30 00:37:00,564 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-30 00:37:00,565 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-30 00:37:00,565 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-30 00:37:00,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 00:37:00,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-30 00:37:00,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:37:00,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:37:00,569 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-30 00:37:03,209 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:37:03,209 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-30 00:37:03,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:37:03 BoogieIcfgContainer [2020-11-30 00:37:03,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:37:03,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 00:37:03,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 00:37:03,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 00:37:03,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:36:59" (1/3) ... [2020-11-30 00:37:03,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c8b1272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:37:03, skipping insertion in model container [2020-11-30 00:37:03,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:00" (2/3) ... [2020-11-30 00:37:03,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c8b1272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:37:03, skipping insertion in model container [2020-11-30 00:37:03,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:37:03" (3/3) ... [2020-11-30 00:37:03,223 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt.i [2020-11-30 00:37:03,234 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-30 00:37:03,234 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 00:37:03,239 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-30 00:37:03,240 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-30 00:37:03,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,278 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,278 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,281 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,282 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,282 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,283 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,283 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,283 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,283 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,284 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,291 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,291 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,294 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,295 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,295 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:37:03,302 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-30 00:37:03,314 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-11-30 00:37:03,340 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 00:37:03,340 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 00:37:03,341 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 00:37:03,341 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:37:03,341 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:37:03,341 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 00:37:03,341 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:37:03,341 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 00:37:03,352 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-30 00:37:03,354 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 87 transitions, 184 flow [2020-11-30 00:37:03,357 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 87 transitions, 184 flow [2020-11-30 00:37:03,359 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 91 places, 87 transitions, 184 flow [2020-11-30 00:37:03,406 INFO L129 PetriNetUnfolder]: 3/85 cut-off events. [2020-11-30 00:37:03,406 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-30 00:37:03,410 INFO L80 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 3/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2020-11-30 00:37:03,413 INFO L116 LiptonReduction]: Number of co-enabled transitions 1182 [2020-11-30 00:37:03,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 00:37:03,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:04,287 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-11-30 00:37:04,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 00:37:04,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:04,699 WARN L193 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-30 00:37:04,816 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-30 00:37:05,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:37:05,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:05,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:37:05,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:05,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:37:05,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:05,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:37:05,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:05,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:37:05,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:05,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:37:05,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:05,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:37:05,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:05,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:37:05,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:05,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:37:05,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:05,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:37:05,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:05,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:37:05,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:05,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-11-30 00:37:05,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:05,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:05,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:05,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-30 00:37:05,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:05,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-30 00:37:05,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:05,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-30 00:37:05,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:37:05,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-30 00:37:05,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:37:05,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-30 00:37:05,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:37:05,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-30 00:37:05,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:05,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-30 00:37:05,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:05,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-30 00:37:05,663 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:05,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:37:05,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:05,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:37:05,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:05,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-30 00:37:05,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-30 00:37:05,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-30 00:37:05,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:05,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:37:05,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:05,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:37:05,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:05,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:37:05,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:05,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:37:05,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:05,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:37:05,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:05,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-11-30 00:37:05,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:05,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:37:05,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:05,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:37:05,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:05,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:37:05,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:05,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:37:05,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:37:06,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:37:06,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:06,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:06,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-30 00:37:06,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-30 00:37:06,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-30 00:37:06,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:37:06,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-30 00:37:06,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:37:06,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-30 00:37:06,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:37:06,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-30 00:37:06,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-30 00:37:06,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-30 00:37:06,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:37:06,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:37:06,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-30 00:37:06,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-30 00:37:06,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-30 00:37:06,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,368 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-30 00:37:06,484 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-30 00:37:06,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-11-30 00:37:06,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:37:06,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:37:06,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:37:06,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,671 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 00:37:06,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-30 00:37:06,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-30 00:37:06,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:37:06,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,710 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:37:06,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:37:06,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:37:06,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:37:06,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:37:06,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:37:06,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:37:06,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:37:06,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:37:06,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:37:06,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:06,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:37:06,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:07,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:07,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:07,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:07,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:07,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:07,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:37:07,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:37:07,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:37:07,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:07,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:07,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:07,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:07,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:07,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:07,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:37:07,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:07,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:07,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:07,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:07,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:07,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:07,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:07,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:37:07,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:07,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:37:07,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:07,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:07,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:07,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:07,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:37:07,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:37:07,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:37:07,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:07,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:07,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:07,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:07,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:07,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:37:07,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:37:07,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:37:07,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:07,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:07,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:07,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:07,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:07,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:07,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:37:07,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:07,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:37:07,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:07,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:07,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:07,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:07,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:07,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:37:07,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:07,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:07,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:07,593 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:07,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:07,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:07,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:37:07,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:37:07,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:37:07,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:37:07,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:07,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:37:07,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:07,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:37:07,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:07,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:37:07,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:09,000 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-11-30 00:37:09,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-11-30 00:37:09,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:09,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:37:09,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:10,211 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 145 DAG size of output: 124 [2020-11-30 00:37:11,273 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 234 DAG size of output: 194 [2020-11-30 00:37:11,293 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-11-30 00:37:11,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:11,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:37:11,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:12,537 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 151 DAG size of output: 122 [2020-11-30 00:37:12,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:37:12,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:12,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:12,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:12,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:12,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:37:12,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:37:12,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:37:12,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:37:12,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:12,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:12,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:12,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:12,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:12,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:37:12,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:12,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:37:12,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:12,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:12,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:12,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:12,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:12,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:37:12,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:12,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:37:12,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:12,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:12,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:12,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:12,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:37:12,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:37:12,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:37:12,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:37:12,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:12,923 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:12,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:12,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:12,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:37:12,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:37:12,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:37:12,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:12,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:12,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:12,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:12,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:12,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:12,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:37:12,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:12,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:12,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:12,983 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:12,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:12,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:12,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:12,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:37:12,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:37:13,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:13,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:13,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:13,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:37:13,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:37:13,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:37:13,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:37:13,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:37:13,677 WARN L193 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 127 [2020-11-30 00:37:14,037 WARN L193 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-11-30 00:37:14,637 WARN L193 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2020-11-30 00:37:14,920 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-11-30 00:37:15,442 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2020-11-30 00:37:15,546 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-11-30 00:37:16,023 WARN L193 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2020-11-30 00:37:16,183 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-30 00:37:16,692 INFO L131 LiptonReduction]: Checked pairs total: 3891 [2020-11-30 00:37:16,692 INFO L133 LiptonReduction]: Total number of compositions: 85 [2020-11-30 00:37:16,698 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 22 transitions, 54 flow [2020-11-30 00:37:16,728 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 212 states. [2020-11-30 00:37:16,730 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states. [2020-11-30 00:37:16,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-30 00:37:16,739 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:37:16,740 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-30 00:37:16,740 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:37:16,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:37:16,748 INFO L82 PathProgramCache]: Analyzing trace with hash 919369024, now seen corresponding path program 1 times [2020-11-30 00:37:16,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:37:16,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497974915] [2020-11-30 00:37:16,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:37:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:17,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:37:17,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497974915] [2020-11-30 00:37:17,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:37:17,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-30 00:37:17,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166505253] [2020-11-30 00:37:17,029 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:37:17,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:37:17,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:37:17,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:37:17,050 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 3 states. [2020-11-30 00:37:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:37:17,130 INFO L93 Difference]: Finished difference Result 187 states and 450 transitions. [2020-11-30 00:37:17,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:37:17,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-30 00:37:17,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:37:17,151 INFO L225 Difference]: With dead ends: 187 [2020-11-30 00:37:17,151 INFO L226 Difference]: Without dead ends: 152 [2020-11-30 00:37:17,153 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:37:17,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-11-30 00:37:17,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2020-11-30 00:37:17,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-11-30 00:37:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 357 transitions. [2020-11-30 00:37:17,233 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 357 transitions. Word has length 5 [2020-11-30 00:37:17,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:37:17,233 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 357 transitions. [2020-11-30 00:37:17,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:37:17,234 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 357 transitions. [2020-11-30 00:37:17,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-30 00:37:17,234 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:37:17,234 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:37:17,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 00:37:17,235 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:37:17,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:37:17,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1249572569, now seen corresponding path program 1 times [2020-11-30 00:37:17,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:37:17,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607029432] [2020-11-30 00:37:17,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:37:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:17,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:37:17,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607029432] [2020-11-30 00:37:17,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:37:17,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-30 00:37:17,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459535619] [2020-11-30 00:37:17,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:37:17,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:37:17,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:37:17,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:37:17,339 INFO L87 Difference]: Start difference. First operand 152 states and 357 transitions. Second operand 3 states. [2020-11-30 00:37:17,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:37:17,369 INFO L93 Difference]: Finished difference Result 150 states and 351 transitions. [2020-11-30 00:37:17,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:37:17,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-30 00:37:17,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:37:17,374 INFO L225 Difference]: With dead ends: 150 [2020-11-30 00:37:17,374 INFO L226 Difference]: Without dead ends: 150 [2020-11-30 00:37:17,375 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:37:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-11-30 00:37:17,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2020-11-30 00:37:17,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-11-30 00:37:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 351 transitions. [2020-11-30 00:37:17,394 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 351 transitions. Word has length 7 [2020-11-30 00:37:17,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:37:17,395 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 351 transitions. [2020-11-30 00:37:17,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:37:17,395 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 351 transitions. [2020-11-30 00:37:17,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-30 00:37:17,396 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:37:17,396 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:37:17,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 00:37:17,397 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:37:17,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:37:17,398 INFO L82 PathProgramCache]: Analyzing trace with hash -796535291, now seen corresponding path program 1 times [2020-11-30 00:37:17,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:37:17,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662953744] [2020-11-30 00:37:17,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:37:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:17,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:37:17,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662953744] [2020-11-30 00:37:17,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:37:17,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-30 00:37:17,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466662880] [2020-11-30 00:37:17,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:37:17,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:37:17,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:37:17,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:37:17,513 INFO L87 Difference]: Start difference. First operand 150 states and 351 transitions. Second operand 3 states. [2020-11-30 00:37:17,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:37:17,527 INFO L93 Difference]: Finished difference Result 137 states and 315 transitions. [2020-11-30 00:37:17,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:37:17,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-11-30 00:37:17,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:37:17,530 INFO L225 Difference]: With dead ends: 137 [2020-11-30 00:37:17,530 INFO L226 Difference]: Without dead ends: 137 [2020-11-30 00:37:17,530 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:37:17,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-11-30 00:37:17,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-11-30 00:37:17,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-11-30 00:37:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 315 transitions. [2020-11-30 00:37:17,539 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 315 transitions. Word has length 8 [2020-11-30 00:37:17,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:37:17,540 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 315 transitions. [2020-11-30 00:37:17,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:37:17,540 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 315 transitions. [2020-11-30 00:37:17,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 00:37:17,541 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:37:17,541 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:37:17,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 00:37:17,542 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:37:17,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:37:17,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1535587376, now seen corresponding path program 1 times [2020-11-30 00:37:17,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:37:17,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358702352] [2020-11-30 00:37:17,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:37:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:17,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:37:17,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358702352] [2020-11-30 00:37:17,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:37:17,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:37:17,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725271938] [2020-11-30 00:37:17,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:37:17,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:37:17,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:37:17,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:37:17,689 INFO L87 Difference]: Start difference. First operand 137 states and 315 transitions. Second operand 5 states. [2020-11-30 00:37:17,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:37:17,773 INFO L93 Difference]: Finished difference Result 193 states and 437 transitions. [2020-11-30 00:37:17,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:37:17,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-11-30 00:37:17,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:37:17,775 INFO L225 Difference]: With dead ends: 193 [2020-11-30 00:37:17,775 INFO L226 Difference]: Without dead ends: 101 [2020-11-30 00:37:17,776 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:37:17,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-11-30 00:37:17,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-11-30 00:37:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-11-30 00:37:17,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 224 transitions. [2020-11-30 00:37:17,781 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 224 transitions. Word has length 10 [2020-11-30 00:37:17,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:37:17,781 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 224 transitions. [2020-11-30 00:37:17,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:37:17,782 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 224 transitions. [2020-11-30 00:37:17,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-30 00:37:17,783 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:37:17,783 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:37:17,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 00:37:17,783 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:37:17,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:37:17,784 INFO L82 PathProgramCache]: Analyzing trace with hash -358553736, now seen corresponding path program 1 times [2020-11-30 00:37:17,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:37:17,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390026754] [2020-11-30 00:37:17,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:37:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:17,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:37:17,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390026754] [2020-11-30 00:37:17,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:37:17,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:37:17,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996381666] [2020-11-30 00:37:17,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:37:17,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:37:17,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:37:17,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:37:17,917 INFO L87 Difference]: Start difference. First operand 101 states and 224 transitions. Second operand 6 states. [2020-11-30 00:37:18,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:37:18,019 INFO L93 Difference]: Finished difference Result 149 states and 328 transitions. [2020-11-30 00:37:18,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:37:18,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-11-30 00:37:18,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:37:18,021 INFO L225 Difference]: With dead ends: 149 [2020-11-30 00:37:18,021 INFO L226 Difference]: Without dead ends: 89 [2020-11-30 00:37:18,021 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:37:18,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-30 00:37:18,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2020-11-30 00:37:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-11-30 00:37:18,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 192 transitions. [2020-11-30 00:37:18,026 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 192 transitions. Word has length 11 [2020-11-30 00:37:18,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:37:18,026 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 192 transitions. [2020-11-30 00:37:18,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:37:18,026 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 192 transitions. [2020-11-30 00:37:18,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-30 00:37:18,027 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:37:18,027 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:37:18,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 00:37:18,027 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:37:18,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:37:18,028 INFO L82 PathProgramCache]: Analyzing trace with hash -358569546, now seen corresponding path program 2 times [2020-11-30 00:37:18,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:37:18,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107256107] [2020-11-30 00:37:18,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:37:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:18,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:37:18,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107256107] [2020-11-30 00:37:18,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:37:18,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-30 00:37:18,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873121379] [2020-11-30 00:37:18,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:37:18,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:37:18,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:37:18,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:37:18,136 INFO L87 Difference]: Start difference. First operand 89 states and 192 transitions. Second operand 3 states. [2020-11-30 00:37:18,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:37:18,159 INFO L93 Difference]: Finished difference Result 85 states and 181 transitions. [2020-11-30 00:37:18,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:37:18,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-30 00:37:18,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:37:18,161 INFO L225 Difference]: With dead ends: 85 [2020-11-30 00:37:18,161 INFO L226 Difference]: Without dead ends: 85 [2020-11-30 00:37:18,161 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:37:18,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-11-30 00:37:18,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-11-30 00:37:18,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-11-30 00:37:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 181 transitions. [2020-11-30 00:37:18,165 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 181 transitions. Word has length 11 [2020-11-30 00:37:18,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:37:18,166 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 181 transitions. [2020-11-30 00:37:18,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:37:18,166 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 181 transitions. [2020-11-30 00:37:18,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-30 00:37:18,167 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:37:18,167 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:37:18,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 00:37:18,167 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:37:18,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:37:18,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1769244320, now seen corresponding path program 1 times [2020-11-30 00:37:18,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:37:18,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200820380] [2020-11-30 00:37:18,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:37:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:37:18,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200820380] [2020-11-30 00:37:18,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:37:18,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:37:18,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129113631] [2020-11-30 00:37:18,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:37:18,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:37:18,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:37:18,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:37:18,295 INFO L87 Difference]: Start difference. First operand 85 states and 181 transitions. Second operand 6 states. [2020-11-30 00:37:18,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:37:18,430 INFO L93 Difference]: Finished difference Result 121 states and 256 transitions. [2020-11-30 00:37:18,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:37:18,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-11-30 00:37:18,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:37:18,433 INFO L225 Difference]: With dead ends: 121 [2020-11-30 00:37:18,433 INFO L226 Difference]: Without dead ends: 73 [2020-11-30 00:37:18,433 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:37:18,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-30 00:37:18,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-11-30 00:37:18,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-11-30 00:37:18,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 149 transitions. [2020-11-30 00:37:18,437 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 149 transitions. Word has length 12 [2020-11-30 00:37:18,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:37:18,437 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 149 transitions. [2020-11-30 00:37:18,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:37:18,437 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 149 transitions. [2020-11-30 00:37:18,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-30 00:37:18,438 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:37:18,438 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:37:18,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 00:37:18,438 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:37:18,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:37:18,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1769229440, now seen corresponding path program 2 times [2020-11-30 00:37:18,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:37:18,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950038457] [2020-11-30 00:37:18,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:37:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:37:18,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950038457] [2020-11-30 00:37:18,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:37:18,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:37:18,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370404084] [2020-11-30 00:37:18,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:37:18,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:37:18,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:37:18,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:37:18,605 INFO L87 Difference]: Start difference. First operand 73 states and 149 transitions. Second operand 5 states. [2020-11-30 00:37:18,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:37:18,693 INFO L93 Difference]: Finished difference Result 72 states and 146 transitions. [2020-11-30 00:37:18,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:37:18,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-30 00:37:18,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:37:18,696 INFO L225 Difference]: With dead ends: 72 [2020-11-30 00:37:18,696 INFO L226 Difference]: Without dead ends: 72 [2020-11-30 00:37:18,696 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:37:18,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-11-30 00:37:18,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-11-30 00:37:18,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-30 00:37:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 146 transitions. [2020-11-30 00:37:18,699 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 146 transitions. Word has length 12 [2020-11-30 00:37:18,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:37:18,700 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 146 transitions. [2020-11-30 00:37:18,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:37:18,700 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 146 transitions. [2020-11-30 00:37:18,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-30 00:37:18,701 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:37:18,701 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:37:18,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 00:37:18,701 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:37:18,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:37:18,702 INFO L82 PathProgramCache]: Analyzing trace with hash -988463819, now seen corresponding path program 1 times [2020-11-30 00:37:18,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:37:18,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889003775] [2020-11-30 00:37:18,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:37:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:18,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-30 00:37:18,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889003775] [2020-11-30 00:37:18,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:37:18,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:37:18,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812605183] [2020-11-30 00:37:18,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:37:18,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:37:18,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:37:18,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:37:18,809 INFO L87 Difference]: Start difference. First operand 72 states and 146 transitions. Second operand 4 states. [2020-11-30 00:37:18,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:37:18,862 INFO L93 Difference]: Finished difference Result 89 states and 169 transitions. [2020-11-30 00:37:18,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:37:18,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-30 00:37:18,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:37:18,864 INFO L225 Difference]: With dead ends: 89 [2020-11-30 00:37:18,864 INFO L226 Difference]: Without dead ends: 70 [2020-11-30 00:37:18,864 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:37:18,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-11-30 00:37:18,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-11-30 00:37:18,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-11-30 00:37:18,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 142 transitions. [2020-11-30 00:37:18,868 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 142 transitions. Word has length 13 [2020-11-30 00:37:18,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:37:18,869 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 142 transitions. [2020-11-30 00:37:18,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:37:18,869 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 142 transitions. [2020-11-30 00:37:18,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-30 00:37:18,870 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:37:18,870 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:37:18,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 00:37:18,870 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:37:18,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:37:18,871 INFO L82 PathProgramCache]: Analyzing trace with hash -88786893, now seen corresponding path program 2 times [2020-11-30 00:37:18,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:37:18,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742623483] [2020-11-30 00:37:18,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:37:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:18,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:37:18,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742623483] [2020-11-30 00:37:18,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:37:18,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:37:18,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422214410] [2020-11-30 00:37:18,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:37:18,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:37:18,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:37:18,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:37:18,974 INFO L87 Difference]: Start difference. First operand 70 states and 142 transitions. Second operand 4 states. [2020-11-30 00:37:19,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:37:19,017 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2020-11-30 00:37:19,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:37:19,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-30 00:37:19,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:37:19,019 INFO L225 Difference]: With dead ends: 61 [2020-11-30 00:37:19,019 INFO L226 Difference]: Without dead ends: 43 [2020-11-30 00:37:19,019 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:37:19,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-11-30 00:37:19,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-11-30 00:37:19,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-11-30 00:37:19,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2020-11-30 00:37:19,021 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 13 [2020-11-30 00:37:19,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:37:19,021 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2020-11-30 00:37:19,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:37:19,022 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2020-11-30 00:37:19,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 00:37:19,022 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:37:19,022 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:37:19,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 00:37:19,022 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:37:19,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:37:19,023 INFO L82 PathProgramCache]: Analyzing trace with hash 530055858, now seen corresponding path program 1 times [2020-11-30 00:37:19,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:37:19,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545505904] [2020-11-30 00:37:19,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:37:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:37:19,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545505904] [2020-11-30 00:37:19,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:37:19,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:37:19,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111043419] [2020-11-30 00:37:19,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:37:19,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:37:19,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:37:19,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:37:19,153 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 5 states. [2020-11-30 00:37:19,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:37:19,195 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2020-11-30 00:37:19,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:37:19,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-30 00:37:19,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:37:19,197 INFO L225 Difference]: With dead ends: 33 [2020-11-30 00:37:19,197 INFO L226 Difference]: Without dead ends: 26 [2020-11-30 00:37:19,197 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:37:19,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-11-30 00:37:19,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-11-30 00:37:19,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-11-30 00:37:19,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2020-11-30 00:37:19,199 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 14 [2020-11-30 00:37:19,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:37:19,199 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-11-30 00:37:19,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:37:19,200 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-11-30 00:37:19,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-30 00:37:19,200 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:37:19,200 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:37:19,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 00:37:19,201 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:37:19,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:37:19,201 INFO L82 PathProgramCache]: Analyzing trace with hash 542229330, now seen corresponding path program 1 times [2020-11-30 00:37:19,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:37:19,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798464817] [2020-11-30 00:37:19,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:37:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:19,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:37:19,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798464817] [2020-11-30 00:37:19,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:37:19,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:37:19,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297265487] [2020-11-30 00:37:19,468 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:37:19,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:37:19,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:37:19,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:37:19,469 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 7 states. [2020-11-30 00:37:19,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:37:19,543 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2020-11-30 00:37:19,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:37:19,544 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-11-30 00:37:19,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:37:19,544 INFO L225 Difference]: With dead ends: 34 [2020-11-30 00:37:19,544 INFO L226 Difference]: Without dead ends: 22 [2020-11-30 00:37:19,545 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:37:19,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-11-30 00:37:19,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-11-30 00:37:19,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-11-30 00:37:19,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2020-11-30 00:37:19,546 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2020-11-30 00:37:19,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:37:19,546 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-11-30 00:37:19,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:37:19,547 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2020-11-30 00:37:19,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-30 00:37:19,547 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:37:19,547 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:37:19,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 00:37:19,548 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:37:19,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:37:19,548 INFO L82 PathProgramCache]: Analyzing trace with hash 589801010, now seen corresponding path program 2 times [2020-11-30 00:37:19,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:37:19,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785776996] [2020-11-30 00:37:19,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:37:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:37:19,585 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:37:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:37:19,619 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:37:19,663 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:37:19,663 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 00:37:19,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-30 00:37:19,664 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-11-30 00:37:19,673 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L807-->L814: Formula: (let ((.cse6 (= (mod ~x$r_buff0_thd0~0_In-160175942 256) 0)) (.cse7 (= 0 (mod ~x$w_buff0_used~0_In-160175942 256))) (.cse9 (= 0 (mod ~x$w_buff1_used~0_In-160175942 256))) (.cse8 (= (mod ~x$r_buff1_thd0~0_In-160175942 256) 0))) (let ((.cse4 (or .cse9 .cse8)) (.cse2 (not .cse9)) (.cse3 (not .cse8)) (.cse0 (not .cse7)) (.cse1 (not .cse6)) (.cse5 (or .cse6 .cse7))) (and (= ULTIMATE.start_assume_abort_if_not_~cond_Out-160175942 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-160175942|) (or (and .cse0 .cse1 (= ~x$w_buff0~0_In-160175942 ~x~0_Out-160175942)) (and (or (and .cse2 (= ~x$w_buff1~0_In-160175942 ~x~0_Out-160175942) .cse3) (and .cse4 (= ~x~0_In-160175942 ~x~0_Out-160175942))) .cse5)) (= ~x$r_buff0_thd0~0_In-160175942 ~x$r_buff0_thd0~0_Out-160175942) (or (and .cse4 (= ~x$w_buff1_used~0_In-160175942 ~x$w_buff1_used~0_Out-160175942)) (and .cse2 (= ~x$w_buff1_used~0_Out-160175942 0) .cse3)) (= ~x$r_buff1_thd0~0_Out-160175942 ~x$r_buff1_thd0~0_In-160175942) (or (and .cse0 .cse1 (= ~x$w_buff0_used~0_Out-160175942 0)) (and .cse5 (= ~x$w_buff0_used~0_Out-160175942 ~x$w_buff0_used~0_In-160175942))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-160175942 0))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-160175942, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-160175942, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-160175942|, ~x$w_buff1~0=~x$w_buff1~0_In-160175942, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-160175942, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-160175942, ~x~0=~x~0_In-160175942, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-160175942} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-160175942, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-160175942, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-160175942|, ~x$w_buff1~0=~x$w_buff1~0_In-160175942, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-160175942|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-160175942, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-160175942, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-160175942|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-160175942|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-160175942|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-160175942, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-160175942|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-160175942|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-160175942, ~x~0=~x~0_Out-160175942} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ~x~0, ULTIMATE.start_main_#t~ite22, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-11-30 00:37:19,677 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,678 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [757] [2020-11-30 00:37:19,679 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,679 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,680 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,680 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,680 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,682 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,682 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,682 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,683 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,683 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,684 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,684 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,684 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,685 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,685 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,685 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,686 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,686 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,686 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,686 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,686 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,686 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,687 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,687 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,687 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,687 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,687 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,687 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,688 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 12:37:19 BasicIcfg [2020-11-30 00:37:19,742 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 00:37:19,742 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:37:19,743 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:37:19,743 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:37:19,743 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:37:03" (3/4) ... [2020-11-30 00:37:19,745 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 00:37:19,751 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L807-->L814: Formula: (let ((.cse6 (= (mod ~x$r_buff0_thd0~0_In-160175942 256) 0)) (.cse7 (= 0 (mod ~x$w_buff0_used~0_In-160175942 256))) (.cse9 (= 0 (mod ~x$w_buff1_used~0_In-160175942 256))) (.cse8 (= (mod ~x$r_buff1_thd0~0_In-160175942 256) 0))) (let ((.cse4 (or .cse9 .cse8)) (.cse2 (not .cse9)) (.cse3 (not .cse8)) (.cse0 (not .cse7)) (.cse1 (not .cse6)) (.cse5 (or .cse6 .cse7))) (and (= ULTIMATE.start_assume_abort_if_not_~cond_Out-160175942 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-160175942|) (or (and .cse0 .cse1 (= ~x$w_buff0~0_In-160175942 ~x~0_Out-160175942)) (and (or (and .cse2 (= ~x$w_buff1~0_In-160175942 ~x~0_Out-160175942) .cse3) (and .cse4 (= ~x~0_In-160175942 ~x~0_Out-160175942))) .cse5)) (= ~x$r_buff0_thd0~0_In-160175942 ~x$r_buff0_thd0~0_Out-160175942) (or (and .cse4 (= ~x$w_buff1_used~0_In-160175942 ~x$w_buff1_used~0_Out-160175942)) (and .cse2 (= ~x$w_buff1_used~0_Out-160175942 0) .cse3)) (= ~x$r_buff1_thd0~0_Out-160175942 ~x$r_buff1_thd0~0_In-160175942) (or (and .cse0 .cse1 (= ~x$w_buff0_used~0_Out-160175942 0)) (and .cse5 (= ~x$w_buff0_used~0_Out-160175942 ~x$w_buff0_used~0_In-160175942))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-160175942 0))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-160175942, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-160175942, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-160175942|, ~x$w_buff1~0=~x$w_buff1~0_In-160175942, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-160175942, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-160175942, ~x~0=~x~0_In-160175942, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-160175942} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-160175942, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-160175942, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-160175942|, ~x$w_buff1~0=~x$w_buff1~0_In-160175942, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-160175942|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-160175942, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-160175942, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-160175942|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-160175942|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-160175942|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-160175942, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-160175942|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-160175942|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-160175942, ~x~0=~x~0_Out-160175942} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ~x~0, ULTIMATE.start_main_#t~ite22, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-11-30 00:37:19,752 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,753 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [757] [2020-11-30 00:37:19,753 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,753 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,754 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,754 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,754 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,754 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,754 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,754 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,754 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,755 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,755 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,755 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,755 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,755 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,755 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,756 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,756 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,756 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,756 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,756 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,757 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,757 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,757 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,757 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,757 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,757 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,757 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,758 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,758 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,758 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,758 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,758 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,758 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,758 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,758 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,759 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,759 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,759 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,759 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,759 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,759 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,759 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,760 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,760 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,760 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,760 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,760 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:37:19,760 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:37:19,838 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_85511e4e-bda3-4b1d-a41a-874e5cf9718c/bin/uautomizer/witness.graphml [2020-11-30 00:37:19,838 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:37:19,840 INFO L168 Benchmark]: Toolchain (without parser) took 20298.21 ms. Allocated memory was 81.8 MB in the beginning and 281.0 MB in the end (delta: 199.2 MB). Free memory was 45.9 MB in the beginning and 104.0 MB in the end (delta: -58.2 MB). Peak memory consumption was 140.8 MB. Max. memory is 16.1 GB. [2020-11-30 00:37:19,840 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 81.8 MB. Free memory was 57.4 MB in the beginning and 57.3 MB in the end (delta: 24.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:37:19,840 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.52 ms. Allocated memory is still 81.8 MB. Free memory was 45.7 MB in the beginning and 35.4 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 00:37:19,841 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.43 ms. Allocated memory is still 81.8 MB. Free memory was 35.1 MB in the beginning and 32.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:37:19,841 INFO L168 Benchmark]: Boogie Preprocessor took 69.07 ms. Allocated memory is still 81.8 MB. Free memory was 32.4 MB in the beginning and 30.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:37:19,842 INFO L168 Benchmark]: RCFGBuilder took 2756.02 ms. Allocated memory was 81.8 MB in the beginning and 125.8 MB in the end (delta: 44.0 MB). Free memory was 30.3 MB in the beginning and 90.6 MB in the end (delta: -60.3 MB). Peak memory consumption was 36.9 MB. Max. memory is 16.1 GB. [2020-11-30 00:37:19,842 INFO L168 Benchmark]: TraceAbstraction took 16528.98 ms. Allocated memory was 125.8 MB in the beginning and 281.0 MB in the end (delta: 155.2 MB). Free memory was 90.6 MB in the beginning and 115.7 MB in the end (delta: -25.1 MB). Peak memory consumption was 132.2 MB. Max. memory is 16.1 GB. [2020-11-30 00:37:19,843 INFO L168 Benchmark]: Witness Printer took 95.94 ms. Allocated memory is still 281.0 MB. Free memory was 115.7 MB in the beginning and 104.0 MB in the end (delta: 11.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 00:37:19,845 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.27 ms. Allocated memory is still 81.8 MB. Free memory was 57.4 MB in the beginning and 57.3 MB in the end (delta: 24.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 747.52 ms. Allocated memory is still 81.8 MB. Free memory was 45.7 MB in the beginning and 35.4 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 94.43 ms. Allocated memory is still 81.8 MB. Free memory was 35.1 MB in the beginning and 32.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 69.07 ms. Allocated memory is still 81.8 MB. Free memory was 32.4 MB in the beginning and 30.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2756.02 ms. Allocated memory was 81.8 MB in the beginning and 125.8 MB in the end (delta: 44.0 MB). Free memory was 30.3 MB in the beginning and 90.6 MB in the end (delta: -60.3 MB). Peak memory consumption was 36.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 16528.98 ms. Allocated memory was 125.8 MB in the beginning and 281.0 MB in the end (delta: 155.2 MB). Free memory was 90.6 MB in the beginning and 115.7 MB in the end (delta: -25.1 MB). Peak memory consumption was 132.2 MB. Max. memory is 16.1 GB. * Witness Printer took 95.94 ms. Allocated memory is still 281.0 MB. Free memory was 115.7 MB in the beginning and 104.0 MB in the end (delta: 11.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 909 VarBasedMoverChecksPositive, 94 VarBasedMoverChecksNegative, 31 SemBasedMoverChecksPositive, 63 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.8s, 95 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 13.3s, 91 PlacesBefore, 28 PlacesAfterwards, 87 TransitionsBefore, 22 TransitionsAfterwards, 1182 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 85 TotalNumberOfCompositions, 3891 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L800] 0 pthread_t t1587; [L801] FCALL, FORK 0 pthread_create(&t1587, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] 0 pthread_t t1588; [L803] FCALL, FORK 0 pthread_create(&t1588, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L805] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L816] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 0 x$flush_delayed = weak$$choice2 [L819] 0 x$mem_tmp = x [L820] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L820] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L821] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L821] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L822] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L822] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L822] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L822] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L823] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L823] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L824] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L824] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L824] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L825] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L825] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L825] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L825] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L825] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L826] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L826] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L828] 0 x = x$flush_delayed ? x$mem_tmp : x [L829] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "rfi000_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 85 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.3s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.3s, HoareTripleCheckerStatistics: 202 SDtfs, 181 SDslu, 185 SDs, 0 SdLazy, 181 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred 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.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 9398 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...