./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/podwr001_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/podwr001_power.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 f78f93364851602b5f536ccd436285fe4ca0514a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1.25-9a8b2e8 [2020-10-20 03:00:17,428 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 03:00:17,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 03:00:17,475 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 03:00:17,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 03:00:17,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 03:00:17,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 03:00:17,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 03:00:17,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 03:00:17,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 03:00:17,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 03:00:17,499 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 03:00:17,499 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 03:00:17,503 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 03:00:17,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 03:00:17,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 03:00:17,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 03:00:17,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 03:00:17,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 03:00:17,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 03:00:17,513 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 03:00:17,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 03:00:17,515 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 03:00:17,516 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 03:00:17,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 03:00:17,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 03:00:17,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 03:00:17,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 03:00:17,519 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 03:00:17,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 03:00:17,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 03:00:17,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 03:00:17,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 03:00:17,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 03:00:17,523 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 03:00:17,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 03:00:17,524 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 03:00:17,524 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 03:00:17,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 03:00:17,525 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 03:00:17,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 03:00:17,527 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 03:00:17,569 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 03:00:17,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 03:00:17,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 03:00:17,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 03:00:17,571 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 03:00:17,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 03:00:17,572 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 03:00:17,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 03:00:17,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 03:00:17,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 03:00:17,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 03:00:17,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 03:00:17,575 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 03:00:17,575 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 03:00:17,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 03:00:17,576 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 03:00:17,576 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 03:00:17,576 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 03:00:17,577 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 03:00:17,577 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 03:00:17,577 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 03:00:17,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 03:00:17,578 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 03:00:17,578 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 03:00:17,578 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 03:00:17,579 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 03:00:17,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 03:00:17,579 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 03:00:17,579 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 03:00:17,580 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> f78f93364851602b5f536ccd436285fe4ca0514a [2020-10-20 03:00:17,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 03:00:17,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 03:00:17,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 03:00:17,811 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 03:00:17,812 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 03:00:17,813 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/podwr001_power.opt.i [2020-10-20 03:00:17,889 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/615023f96/c6f01eec78604559b81c5db199c8679f/FLAGd213a3559 [2020-10-20 03:00:18,533 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 03:00:18,535 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/podwr001_power.opt.i [2020-10-20 03:00:18,562 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/615023f96/c6f01eec78604559b81c5db199c8679f/FLAGd213a3559 [2020-10-20 03:00:18,763 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/615023f96/c6f01eec78604559b81c5db199c8679f [2020-10-20 03:00:18,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 03:00:18,774 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 03:00:18,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 03:00:18,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 03:00:18,782 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 03:00:18,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 03:00:18" (1/1) ... [2020-10-20 03:00:18,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@839e46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:00:18, skipping insertion in model container [2020-10-20 03:00:18,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 03:00:18" (1/1) ... [2020-10-20 03:00:18,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 03:00:18,867 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 03:00:19,301 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 03:00:19,313 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 03:00:19,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 03:00:19,468 INFO L208 MainTranslator]: Completed translation [2020-10-20 03:00:19,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:00:19 WrapperNode [2020-10-20 03:00:19,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 03:00:19,470 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 03:00:19,470 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 03:00:19,470 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 03:00:19,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:00:19" (1/1) ... [2020-10-20 03:00:19,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:00:19" (1/1) ... [2020-10-20 03:00:19,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 03:00:19,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 03:00:19,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 03:00:19,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 03:00:19,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:00:19" (1/1) ... [2020-10-20 03:00:19,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:00:19" (1/1) ... [2020-10-20 03:00:19,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:00:19" (1/1) ... [2020-10-20 03:00:19,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:00:19" (1/1) ... [2020-10-20 03:00:19,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:00:19" (1/1) ... [2020-10-20 03:00:19,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:00:19" (1/1) ... [2020-10-20 03:00:19,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:00:19" (1/1) ... [2020-10-20 03:00:19,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 03:00:19,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 03:00:19,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 03:00:19,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 03:00:19,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:00:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 03:00:19,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 03:00:19,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-20 03:00:19,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 03:00:19,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 03:00:19,692 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-20 03:00:19,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-20 03:00:19,693 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-20 03:00:19,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-20 03:00:19,693 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-20 03:00:19,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-20 03:00:19,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 03:00:19,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-20 03:00:19,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 03:00:19,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 03:00:19,697 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-20 03:00:22,026 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 03:00:22,027 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-20 03:00:22,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:00:22 BoogieIcfgContainer [2020-10-20 03:00:22,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 03:00:22,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 03:00:22,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 03:00:22,035 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 03:00:22,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 03:00:18" (1/3) ... [2020-10-20 03:00:22,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390baf03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 03:00:22, skipping insertion in model container [2020-10-20 03:00:22,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:00:19" (2/3) ... [2020-10-20 03:00:22,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390baf03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 03:00:22, skipping insertion in model container [2020-10-20 03:00:22,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:00:22" (3/3) ... [2020-10-20 03:00:22,061 INFO L111 eAbstractionObserver]: Analyzing ICFG podwr001_power.opt.i [2020-10-20 03:00:22,074 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-20 03:00:22,075 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 03:00:22,083 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-20 03:00:22,084 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-20 03:00:22,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,118 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,118 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,119 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,120 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,124 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,125 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,128 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,129 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,133 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,133 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,133 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,133 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,133 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,134 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,134 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,134 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,134 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,139 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,142 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,147 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,149 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,150 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,154 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,154 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,163 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,163 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,163 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,163 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,163 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,163 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,164 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,164 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,164 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,164 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,164 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,165 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,165 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,166 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,166 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,166 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,166 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,166 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,167 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,167 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,167 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,167 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,168 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,168 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,168 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,168 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,169 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,169 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:22,171 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-20 03:00:22,185 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-20 03:00:22,208 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 03:00:22,209 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 03:00:22,209 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 03:00:22,209 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 03:00:22,209 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 03:00:22,210 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 03:00:22,210 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 03:00:22,210 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 03:00:22,225 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-20 03:00:22,228 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 103 transitions, 221 flow [2020-10-20 03:00:22,231 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 103 transitions, 221 flow [2020-10-20 03:00:22,233 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 110 places, 103 transitions, 221 flow [2020-10-20 03:00:22,288 INFO L129 PetriNetUnfolder]: 3/100 cut-off events. [2020-10-20 03:00:22,289 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-20 03:00:22,295 INFO L80 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 100 events. 3/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2020-10-20 03:00:22,299 INFO L117 LiptonReduction]: Number of co-enabled transitions 1870 [2020-10-20 03:00:22,561 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-10-20 03:00:22,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:00:22,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:22,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:00:22,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:22,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:00:22,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:23,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 03:00:23,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:23,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:23,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:23,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:23,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:23,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:23,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:23,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:23,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:23,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:23,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:23,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:23,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:23,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:23,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:23,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:23,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:23,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:23,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:23,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:23,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:23,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:23,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:23,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:23,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:23,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:23,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:23,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:23,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:23,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:23,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:23,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:23,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:23,826 WARN L193 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-20 03:00:23,931 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-20 03:00:24,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:24,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:24,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:24,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:24,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:24,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:24,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:24,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:24,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:24,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:24,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:24,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:24,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:24,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:24,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:24,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:24,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:24,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:24,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:24,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:00:24,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:00:24,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:00:24,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:00:24,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:00:24,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:00:24,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:00:24,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:24,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:00:24,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:24,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:00:24,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:24,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:00:24,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 03:00:24,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:00:24,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:24,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:24,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:24,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:24,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:24,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:24,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:00:24,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 03:00:24,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:00:24,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,677 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:00:24,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:00:24,680 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:00:24,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:00:24,682 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:00:24,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:00:24,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:00:24,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:24,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:00:24,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:24,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:00:24,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:24,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:24,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:24,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:24,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:24,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:24,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:24,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:24,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:24,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:24,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:24,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:24,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:24,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:24,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:24,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:25,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:25,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:25,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:25,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:25,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:25,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:25,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:25,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:25,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:25,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:25,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:25,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:25,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:25,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:25,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:25,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:25,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:25,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:25,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:25,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:25,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:25,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:25,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:25,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:25,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:25,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:25,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:25,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:25,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:25,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:25,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:25,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:25,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:25,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:25,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:25,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:25,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:25,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:25,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:25,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:25,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:25,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:25,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:25,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:25,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:25,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:25,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:25,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:25,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:25,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:25,346 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:25,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:25,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:25,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:25,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:25,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:25,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:25,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:25,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:25,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:25,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:25,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:25,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:25,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:25,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:25,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:25,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:25,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:25,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:25,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:25,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:25,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:25,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:25,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:25,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:25,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:25,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:25,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:25,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:25,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:26,176 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-20 03:00:26,324 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-20 03:00:26,808 WARN L193 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-10-20 03:00:26,995 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-10-20 03:00:27,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:27,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:27,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:00:27,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:00:27,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:00:27,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:00:27,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:00:27,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:00:27,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:00:27,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:27,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:00:27,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:27,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:00:27,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:27,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:00:27,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 03:00:27,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:00:27,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:27,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:00:27,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 03:00:27,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:00:27,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:27,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:27,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:27,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:00:27,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:00:27,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:00:27,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:00:27,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:00:27,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:00:27,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:00:27,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:27,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:00:27,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:27,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:00:27,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:27,255 INFO L132 LiptonReduction]: Checked pairs total: 5118 [2020-10-20 03:00:27,255 INFO L134 LiptonReduction]: Total number of compositions: 94 [2020-10-20 03:00:27,263 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-20 03:00:27,312 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 824 states. [2020-10-20 03:00:27,315 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states. [2020-10-20 03:00:27,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-20 03:00:27,322 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:27,323 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-20 03:00:27,324 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:27,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:27,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1099136, now seen corresponding path program 1 times [2020-10-20 03:00:27,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:27,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314043127] [2020-10-20 03:00:27,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:00:27,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:00:27,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314043127] [2020-10-20 03:00:27,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:00:27,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-20 03:00:27,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306845657] [2020-10-20 03:00:27,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 03:00:27,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:00:27,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 03:00:27,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:00:27,582 INFO L87 Difference]: Start difference. First operand 824 states. Second operand 3 states. [2020-10-20 03:00:27,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:00:27,686 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-10-20 03:00:27,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:00:27,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-20 03:00:27,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:00:27,711 INFO L225 Difference]: With dead ends: 687 [2020-10-20 03:00:27,711 INFO L226 Difference]: Without dead ends: 562 [2020-10-20 03:00:27,713 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-10-20 03:00:27,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-10-20 03:00:27,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-10-20 03:00:27,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-20 03:00:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-10-20 03:00:27,804 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 3 [2020-10-20 03:00:27,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:00:27,806 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-10-20 03:00:27,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 03:00:27,808 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-10-20 03:00:27,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 03:00:27,810 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:27,810 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:00:27,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 03:00:27,811 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:27,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:27,812 INFO L82 PathProgramCache]: Analyzing trace with hash 452985326, now seen corresponding path program 1 times [2020-10-20 03:00:27,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:27,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217355935] [2020-10-20 03:00:27,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:00:27,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:00:27,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217355935] [2020-10-20 03:00:27,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:00:27,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:00:27,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583026417] [2020-10-20 03:00:27,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:00:27,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:00:27,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:00:27,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:00:27,998 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 4 states. [2020-10-20 03:00:28,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:00:28,052 INFO L93 Difference]: Finished difference Result 495 states and 1321 transitions. [2020-10-20 03:00:28,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 03:00:28,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-10-20 03:00:28,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:00:28,056 INFO L225 Difference]: With dead ends: 495 [2020-10-20 03:00:28,056 INFO L226 Difference]: Without dead ends: 370 [2020-10-20 03:00:28,057 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-10-20 03:00:28,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2020-10-20 03:00:28,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2020-10-20 03:00:28,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-10-20 03:00:28,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 957 transitions. [2020-10-20 03:00:28,071 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 957 transitions. Word has length 9 [2020-10-20 03:00:28,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:00:28,071 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 957 transitions. [2020-10-20 03:00:28,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:00:28,071 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 957 transitions. [2020-10-20 03:00:28,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 03:00:28,073 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:28,073 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:00:28,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 03:00:28,074 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:28,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:28,074 INFO L82 PathProgramCache]: Analyzing trace with hash -889611962, now seen corresponding path program 1 times [2020-10-20 03:00:28,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:28,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308597847] [2020-10-20 03:00:28,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:00:28,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:00:28,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308597847] [2020-10-20 03:00:28,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:00:28,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 03:00:28,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48251399] [2020-10-20 03:00:28,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:00:28,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:00:28,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:00:28,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:00:28,259 INFO L87 Difference]: Start difference. First operand 370 states and 957 transitions. Second operand 5 states. [2020-10-20 03:00:28,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:00:28,322 INFO L93 Difference]: Finished difference Result 287 states and 681 transitions. [2020-10-20 03:00:28,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:00:28,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-20 03:00:28,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:00:28,324 INFO L225 Difference]: With dead ends: 287 [2020-10-20 03:00:28,324 INFO L226 Difference]: Without dead ends: 226 [2020-10-20 03:00:28,325 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-10-20 03:00:28,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-10-20 03:00:28,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2020-10-20 03:00:28,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-10-20 03:00:28,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 525 transitions. [2020-10-20 03:00:28,331 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 525 transitions. Word has length 13 [2020-10-20 03:00:28,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:00:28,331 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 525 transitions. [2020-10-20 03:00:28,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:00:28,332 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 525 transitions. [2020-10-20 03:00:28,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 03:00:28,334 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:28,334 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:00:28,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 03:00:28,334 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:28,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:28,335 INFO L82 PathProgramCache]: Analyzing trace with hash -701680187, now seen corresponding path program 1 times [2020-10-20 03:00:28,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:28,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597434872] [2020-10-20 03:00:28,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:00:28,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:00:28,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597434872] [2020-10-20 03:00:28,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:00:28,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 03:00:28,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560662898] [2020-10-20 03:00:28,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 03:00:28,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:00:28,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 03:00:28,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:00:28,514 INFO L87 Difference]: Start difference. First operand 226 states and 525 transitions. Second operand 6 states. [2020-10-20 03:00:28,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:00:28,572 INFO L93 Difference]: Finished difference Result 203 states and 477 transitions. [2020-10-20 03:00:28,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:00:28,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-20 03:00:28,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:00:28,574 INFO L225 Difference]: With dead ends: 203 [2020-10-20 03:00:28,574 INFO L226 Difference]: Without dead ends: 190 [2020-10-20 03:00:28,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:00:28,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-10-20 03:00:28,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2020-10-20 03:00:28,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-10-20 03:00:28,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 453 transitions. [2020-10-20 03:00:28,580 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 453 transitions. Word has length 17 [2020-10-20 03:00:28,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:00:28,581 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 453 transitions. [2020-10-20 03:00:28,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 03:00:28,581 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 453 transitions. [2020-10-20 03:00:28,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 03:00:28,583 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:28,584 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:00:28,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 03:00:28,584 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:28,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:28,584 INFO L82 PathProgramCache]: Analyzing trace with hash 2064304371, now seen corresponding path program 1 times [2020-10-20 03:00:28,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:28,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336228020] [2020-10-20 03:00:28,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:00:28,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:00:28,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336228020] [2020-10-20 03:00:28,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:00:28,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:00:28,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520192216] [2020-10-20 03:00:28,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:00:28,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:00:28,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:00:28,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:00:28,688 INFO L87 Difference]: Start difference. First operand 190 states and 453 transitions. Second operand 4 states. [2020-10-20 03:00:28,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:00:28,708 INFO L93 Difference]: Finished difference Result 276 states and 646 transitions. [2020-10-20 03:00:28,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 03:00:28,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-20 03:00:28,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:00:28,710 INFO L225 Difference]: With dead ends: 276 [2020-10-20 03:00:28,710 INFO L226 Difference]: Without dead ends: 134 [2020-10-20 03:00:28,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-20 03:00:28,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-10-20 03:00:28,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2020-10-20 03:00:28,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-10-20 03:00:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 293 transitions. [2020-10-20 03:00:28,715 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 293 transitions. Word has length 21 [2020-10-20 03:00:28,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:00:28,716 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 293 transitions. [2020-10-20 03:00:28,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:00:28,716 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 293 transitions. [2020-10-20 03:00:28,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 03:00:28,721 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:28,721 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:00:28,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 03:00:28,721 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:28,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:28,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1110835827, now seen corresponding path program 2 times [2020-10-20 03:00:28,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:28,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153193487] [2020-10-20 03:00:28,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:00:28,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:00:28,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153193487] [2020-10-20 03:00:28,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:00:28,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:00:28,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781430180] [2020-10-20 03:00:28,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:00:28,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:00:28,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:00:28,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:00:28,833 INFO L87 Difference]: Start difference. First operand 134 states and 293 transitions. Second operand 4 states. [2020-10-20 03:00:28,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:00:28,849 INFO L93 Difference]: Finished difference Result 172 states and 370 transitions. [2020-10-20 03:00:28,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 03:00:28,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-20 03:00:28,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:00:28,851 INFO L225 Difference]: With dead ends: 172 [2020-10-20 03:00:28,851 INFO L226 Difference]: Without dead ends: 102 [2020-10-20 03:00:28,852 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-10-20 03:00:28,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-20 03:00:28,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-10-20 03:00:28,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-10-20 03:00:28,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 213 transitions. [2020-10-20 03:00:28,855 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 213 transitions. Word has length 21 [2020-10-20 03:00:28,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:00:28,856 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 213 transitions. [2020-10-20 03:00:28,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:00:28,856 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 213 transitions. [2020-10-20 03:00:28,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 03:00:28,857 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:28,857 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:00:28,857 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 03:00:28,858 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:28,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:28,858 INFO L82 PathProgramCache]: Analyzing trace with hash -640418189, now seen corresponding path program 3 times [2020-10-20 03:00:28,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:28,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655439820] [2020-10-20 03:00:28,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:00:29,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:00:29,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655439820] [2020-10-20 03:00:29,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:00:29,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 03:00:29,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083414279] [2020-10-20 03:00:29,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 03:00:29,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:00:29,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 03:00:29,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:00:29,106 INFO L87 Difference]: Start difference. First operand 102 states and 213 transitions. Second operand 7 states. [2020-10-20 03:00:29,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:00:29,241 INFO L93 Difference]: Finished difference Result 122 states and 248 transitions. [2020-10-20 03:00:29,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:00:29,241 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-20 03:00:29,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:00:29,242 INFO L225 Difference]: With dead ends: 122 [2020-10-20 03:00:29,242 INFO L226 Difference]: Without dead ends: 62 [2020-10-20 03:00:29,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:00:29,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-20 03:00:29,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-20 03:00:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-20 03:00:29,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 109 transitions. [2020-10-20 03:00:29,245 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 109 transitions. Word has length 21 [2020-10-20 03:00:29,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:00:29,245 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 109 transitions. [2020-10-20 03:00:29,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 03:00:29,246 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 109 transitions. [2020-10-20 03:00:29,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 03:00:29,246 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:29,246 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:00:29,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 03:00:29,247 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:29,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:29,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1116555597, now seen corresponding path program 4 times [2020-10-20 03:00:29,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:29,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950087811] [2020-10-20 03:00:29,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 03:00:29,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 03:00:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 03:00:29,395 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 03:00:29,463 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 03:00:29,464 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 03:00:29,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 03:00:29,465 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-20 03:00:29,481 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1051] [1051] L3-->L851: Formula: (let ((.cse7 (= (mod ~z$r_buff1_thd0~0_In1580197531 256) 0)) (.cse6 (= (mod ~z$w_buff1_used~0_In1580197531 256) 0)) (.cse8 (= (mod ~z$w_buff0_used~0_In1580197531 256) 0)) (.cse9 (= (mod ~z$r_buff0_thd0~0_In1580197531 256) 0))) (let ((.cse0 (or .cse8 .cse9)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse1 (not .cse6)) (.cse2 (not .cse7)) (.cse3 (or .cse6 .cse7))) (and (or (and .cse0 (or (and .cse1 .cse2 (= ~z$w_buff1~0_In1580197531 ~z~0_Out1580197531)) (and .cse3 (= ~z~0_In1580197531 ~z~0_Out1580197531)))) (and .cse4 (= ~z~0_Out1580197531 ~z$w_buff0~0_In1580197531) .cse5)) (or (and .cse0 (= ~z$w_buff0_used~0_Out1580197531 ~z$w_buff0_used~0_In1580197531)) (and .cse4 .cse5 (= ~z$w_buff0_used~0_Out1580197531 0))) (= ~z$r_buff1_thd0~0_Out1580197531 ~z$r_buff1_thd0~0_In1580197531) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In1580197531 0)) (= ~z$r_buff0_thd0~0_In1580197531 ~z$r_buff0_thd0~0_Out1580197531) (or (and .cse1 .cse2 (= ~z$w_buff1_used~0_Out1580197531 0)) (and .cse3 (= ~z$w_buff1_used~0_Out1580197531 ~z$w_buff1_used~0_In1580197531)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1580197531, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1580197531, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1580197531, ~z$w_buff0~0=~z$w_buff0~0_In1580197531, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1580197531, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1580197531, ~z$w_buff1~0=~z$w_buff1~0_In1580197531, ~z~0=~z~0_In1580197531} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out1580197531, ~z$w_buff0~0=~z$w_buff0~0_In1580197531, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1580197531, ~z$w_buff1~0=~z$w_buff1~0_In1580197531, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1580197531|, ULTIMATE.start_main_#t~ite54=|ULTIMATE.start_main_#t~ite54_Out1580197531|, ULTIMATE.start_main_#t~ite53=|ULTIMATE.start_main_#t~ite53_Out1580197531|, ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1580197531|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out1580197531, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1580197531|, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1580197531|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1580197531, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1580197531, ~z~0=~z~0_Out1580197531} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_#t~ite51, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite49, ~z~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53] because there is no mapped edge [2020-10-20 03:00:29,493 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,493 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [744] [2020-10-20 03:00:29,494 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,494 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,495 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,495 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,495 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,496 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,496 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,496 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,496 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,496 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,496 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,496 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,497 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,497 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,498 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,498 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,498 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,498 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,499 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,499 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,499 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,499 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,499 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,499 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,499 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,500 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,500 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,500 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,500 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,500 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,500 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,500 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,506 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,507 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,507 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,507 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,507 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,507 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,508 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,508 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,508 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,508 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,508 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,508 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,508 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,509 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,511 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,511 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,511 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,511 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,511 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,511 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,512 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,512 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,512 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,512 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 03:00:29 BasicIcfg [2020-10-20 03:00:29,628 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 03:00:29,628 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 03:00:29,628 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 03:00:29,628 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 03:00:29,629 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:00:22" (3/4) ... [2020-10-20 03:00:29,633 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 03:00:29,644 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1051] [1051] L3-->L851: Formula: (let ((.cse7 (= (mod ~z$r_buff1_thd0~0_In1580197531 256) 0)) (.cse6 (= (mod ~z$w_buff1_used~0_In1580197531 256) 0)) (.cse8 (= (mod ~z$w_buff0_used~0_In1580197531 256) 0)) (.cse9 (= (mod ~z$r_buff0_thd0~0_In1580197531 256) 0))) (let ((.cse0 (or .cse8 .cse9)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse1 (not .cse6)) (.cse2 (not .cse7)) (.cse3 (or .cse6 .cse7))) (and (or (and .cse0 (or (and .cse1 .cse2 (= ~z$w_buff1~0_In1580197531 ~z~0_Out1580197531)) (and .cse3 (= ~z~0_In1580197531 ~z~0_Out1580197531)))) (and .cse4 (= ~z~0_Out1580197531 ~z$w_buff0~0_In1580197531) .cse5)) (or (and .cse0 (= ~z$w_buff0_used~0_Out1580197531 ~z$w_buff0_used~0_In1580197531)) (and .cse4 .cse5 (= ~z$w_buff0_used~0_Out1580197531 0))) (= ~z$r_buff1_thd0~0_Out1580197531 ~z$r_buff1_thd0~0_In1580197531) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In1580197531 0)) (= ~z$r_buff0_thd0~0_In1580197531 ~z$r_buff0_thd0~0_Out1580197531) (or (and .cse1 .cse2 (= ~z$w_buff1_used~0_Out1580197531 0)) (and .cse3 (= ~z$w_buff1_used~0_Out1580197531 ~z$w_buff1_used~0_In1580197531)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1580197531, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1580197531, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1580197531, ~z$w_buff0~0=~z$w_buff0~0_In1580197531, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1580197531, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1580197531, ~z$w_buff1~0=~z$w_buff1~0_In1580197531, ~z~0=~z~0_In1580197531} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out1580197531, ~z$w_buff0~0=~z$w_buff0~0_In1580197531, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1580197531, ~z$w_buff1~0=~z$w_buff1~0_In1580197531, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1580197531|, ULTIMATE.start_main_#t~ite54=|ULTIMATE.start_main_#t~ite54_Out1580197531|, ULTIMATE.start_main_#t~ite53=|ULTIMATE.start_main_#t~ite53_Out1580197531|, ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1580197531|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out1580197531, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1580197531|, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1580197531|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1580197531, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1580197531, ~z~0=~z~0_Out1580197531} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_#t~ite51, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite49, ~z~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53] because there is no mapped edge [2020-10-20 03:00:29,646 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,646 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [744] [2020-10-20 03:00:29,647 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,647 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,647 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,647 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,647 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,647 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,648 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,648 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,648 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,648 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,648 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,648 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,648 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,649 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,649 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,649 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,649 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,649 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,649 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,649 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,650 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,650 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,650 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,650 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,650 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,650 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,650 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,650 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,651 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,651 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,651 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,651 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,651 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,651 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,651 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,651 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,652 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,652 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,652 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,652 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,652 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,652 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,652 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,652 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,653 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,653 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,653 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,653 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,653 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,653 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,653 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,653 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,654 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,654 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,654 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:29,654 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:29,807 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 03:00:29,807 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 03:00:29,809 INFO L168 Benchmark]: Toolchain (without parser) took 11040.81 ms. Allocated memory was 41.4 MB in the beginning and 121.1 MB in the end (delta: 79.7 MB). Free memory was 20.3 MB in the beginning and 33.6 MB in the end (delta: -13.3 MB). Peak memory consumption was 66.4 MB. Max. memory is 14.3 GB. [2020-10-20 03:00:29,809 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 31.5 MB. Free memory was 10.2 MB in the beginning and 10.1 MB in the end (delta: 47.5 kB). Peak memory consumption was 47.5 kB. Max. memory is 14.3 GB. [2020-10-20 03:00:29,810 INFO L168 Benchmark]: CACSL2BoogieTranslator took 691.45 ms. Allocated memory was 41.4 MB in the beginning and 43.5 MB in the end (delta: 2.1 MB). Free memory was 19.4 MB in the beginning and 12.3 MB in the end (delta: 7.2 MB). Peak memory consumption was 10.6 MB. Max. memory is 14.3 GB. [2020-10-20 03:00:29,810 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.29 ms. Allocated memory is still 43.5 MB. Free memory was 12.3 MB in the beginning and 9.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 14.3 GB. [2020-10-20 03:00:29,811 INFO L168 Benchmark]: Boogie Preprocessor took 74.06 ms. Allocated memory was 43.5 MB in the beginning and 44.0 MB in the end (delta: 524.3 kB). Free memory was 9.6 MB in the beginning and 26.8 MB in the end (delta: -17.2 MB). Peak memory consumption was 258.4 kB. Max. memory is 14.3 GB. [2020-10-20 03:00:29,811 INFO L168 Benchmark]: RCFGBuilder took 2420.81 ms. Allocated memory was 44.0 MB in the beginning and 60.3 MB in the end (delta: 16.3 MB). Free memory was 26.8 MB in the beginning and 9.2 MB in the end (delta: 17.7 MB). Peak memory consumption was 33.9 MB. Max. memory is 14.3 GB. [2020-10-20 03:00:29,811 INFO L168 Benchmark]: TraceAbstraction took 7596.67 ms. Allocated memory was 60.3 MB in the beginning and 121.1 MB in the end (delta: 60.8 MB). Free memory was 9.2 MB in the beginning and 53.7 MB in the end (delta: -44.5 MB). Peak memory consumption was 16.3 MB. Max. memory is 14.3 GB. [2020-10-20 03:00:29,812 INFO L168 Benchmark]: Witness Printer took 179.41 ms. Allocated memory is still 121.1 MB. Free memory was 53.7 MB in the beginning and 33.6 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 14.3 GB. [2020-10-20 03:00:29,816 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.30 ms. Allocated memory is still 31.5 MB. Free memory was 10.2 MB in the beginning and 10.1 MB in the end (delta: 47.5 kB). Peak memory consumption was 47.5 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 691.45 ms. Allocated memory was 41.4 MB in the beginning and 43.5 MB in the end (delta: 2.1 MB). Free memory was 19.4 MB in the beginning and 12.3 MB in the end (delta: 7.2 MB). Peak memory consumption was 10.6 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 64.29 ms. Allocated memory is still 43.5 MB. Free memory was 12.3 MB in the beginning and 9.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 74.06 ms. Allocated memory was 43.5 MB in the beginning and 44.0 MB in the end (delta: 524.3 kB). Free memory was 9.6 MB in the beginning and 26.8 MB in the end (delta: -17.2 MB). Peak memory consumption was 258.4 kB. Max. memory is 14.3 GB. * RCFGBuilder took 2420.81 ms. Allocated memory was 44.0 MB in the beginning and 60.3 MB in the end (delta: 16.3 MB). Free memory was 26.8 MB in the beginning and 9.2 MB in the end (delta: 17.7 MB). Peak memory consumption was 33.9 MB. Max. memory is 14.3 GB. * TraceAbstraction took 7596.67 ms. Allocated memory was 60.3 MB in the beginning and 121.1 MB in the end (delta: 60.8 MB). Free memory was 9.2 MB in the beginning and 53.7 MB in the end (delta: -44.5 MB). Peak memory consumption was 16.3 MB. Max. memory is 14.3 GB. * Witness Printer took 179.41 ms. Allocated memory is still 121.1 MB. Free memory was 53.7 MB in the beginning and 33.6 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1295 VarBasedMoverChecksPositive, 66 VarBasedMoverChecksNegative, 12 SemBasedMoverChecksPositive, 54 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 133 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.0s, 110 PlacesBefore, 36 PlacesAfterwards, 103 TransitionsBefore, 26 TransitionsAfterwards, 1870 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 94 TotalNumberOfCompositions, 5118 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L723] 0 int z = 0; [L724] 0 _Bool z$flush_delayed; [L725] 0 int z$mem_tmp; [L726] 0 _Bool z$r_buff0_thd0; [L727] 0 _Bool z$r_buff0_thd1; [L728] 0 _Bool z$r_buff0_thd2; [L729] 0 _Bool z$r_buff0_thd3; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$read_delayed; [L735] 0 int *z$read_delayed_var; [L736] 0 int z$w_buff0; [L737] 0 _Bool z$w_buff0_used; [L738] 0 int z$w_buff1; [L739] 0 _Bool z$w_buff1_used; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L835] 0 pthread_t t1564; [L836] FCALL, FORK 0 pthread_create(&t1564, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] 0 pthread_t t1565; [L838] FCALL, FORK 0 pthread_create(&t1565, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] 0 pthread_t t1566; [L840] FCALL, FORK 0 pthread_create(&t1566, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L780] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L794] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 3 z$flush_delayed = weak$$choice2 [L800] 3 z$mem_tmp = z [L801] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L801] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L802] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L802] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L803] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L803] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L803] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L803] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L804] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L804] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L805] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L805] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L806] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L807] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L807] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L807] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L807] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] 3 __unbuffered_p2_EAX = z [L809] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L809] 3 z = z$flush_delayed ? z$mem_tmp : z [L810] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L813] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L813] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L813] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L814] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L815] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L816] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L817] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L853] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "podwr001_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 101 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.2s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 199 SDtfs, 198 SDslu, 369 SDs, 0 SdLazy, 153 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=824occurred 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 8036 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...