./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe003_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/safe003_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 187954dbf25cd71d7ca3b27c6b535338af518436 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:02:55,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 03:02:55,547 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 03:02:55,573 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 03:02:55,573 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 03:02:55,574 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 03:02:55,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 03:02:55,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 03:02:55,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 03:02:55,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 03:02:55,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 03:02:55,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 03:02:55,590 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 03:02:55,591 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 03:02:55,592 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 03:02:55,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 03:02:55,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 03:02:55,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 03:02:55,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 03:02:55,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 03:02:55,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 03:02:55,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 03:02:55,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 03:02:55,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 03:02:55,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 03:02:55,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 03:02:55,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 03:02:55,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 03:02:55,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 03:02:55,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 03:02:55,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 03:02:55,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 03:02:55,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 03:02:55,610 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 03:02:55,611 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 03:02:55,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 03:02:55,612 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 03:02:55,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 03:02:55,613 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 03:02:55,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 03:02:55,614 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 03:02:55,615 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:02:55,638 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 03:02:55,638 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 03:02:55,639 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 03:02:55,639 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 03:02:55,640 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 03:02:55,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 03:02:55,640 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 03:02:55,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 03:02:55,641 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 03:02:55,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 03:02:55,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 03:02:55,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 03:02:55,642 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 03:02:55,642 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 03:02:55,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 03:02:55,642 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 03:02:55,643 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 03:02:55,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 03:02:55,643 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 03:02:55,643 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 03:02:55,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 03:02:55,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 03:02:55,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 03:02:55,644 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 03:02:55,645 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 03:02:55,645 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 03:02:55,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 03:02:55,645 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 03:02:55,646 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 03:02:55,646 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 -> 187954dbf25cd71d7ca3b27c6b535338af518436 [2020-10-20 03:02:55,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 03:02:55,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 03:02:55,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 03:02:55,871 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 03:02:55,873 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 03:02:55,874 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe003_power.opt.i [2020-10-20 03:02:55,943 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c5b46ea6/06cf3bb45ed44da99f017bed151f36c0/FLAG5e0035405 [2020-10-20 03:02:56,497 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 03:02:56,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe003_power.opt.i [2020-10-20 03:02:56,512 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c5b46ea6/06cf3bb45ed44da99f017bed151f36c0/FLAG5e0035405 [2020-10-20 03:02:56,761 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c5b46ea6/06cf3bb45ed44da99f017bed151f36c0 [2020-10-20 03:02:56,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 03:02:56,772 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 03:02:56,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 03:02:56,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 03:02:56,777 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 03:02:56,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 03:02:56" (1/1) ... [2020-10-20 03:02:56,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72cc5e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:02:56, skipping insertion in model container [2020-10-20 03:02:56,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 03:02:56" (1/1) ... [2020-10-20 03:02:56,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 03:02:56,863 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 03:02:57,477 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 03:02:57,494 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 03:02:57,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 03:02:57,675 INFO L208 MainTranslator]: Completed translation [2020-10-20 03:02:57,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:02:57 WrapperNode [2020-10-20 03:02:57,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 03:02:57,676 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 03:02:57,676 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 03:02:57,677 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 03:02:57,683 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:02:57" (1/1) ... [2020-10-20 03:02:57,705 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:02:57" (1/1) ... [2020-10-20 03:02:57,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 03:02:57,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 03:02:57,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 03:02:57,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 03:02:57,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:02:57" (1/1) ... [2020-10-20 03:02:57,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:02:57" (1/1) ... [2020-10-20 03:02:57,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:02:57" (1/1) ... [2020-10-20 03:02:57,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:02:57" (1/1) ... [2020-10-20 03:02:57,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:02:57" (1/1) ... [2020-10-20 03:02:57,786 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:02:57" (1/1) ... [2020-10-20 03:02:57,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:02:57" (1/1) ... [2020-10-20 03:02:57,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 03:02:57,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 03:02:57,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 03:02:57,798 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 03:02:57,799 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:02:57" (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:02:57,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 03:02:57,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 03:02:57,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-20 03:02:57,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 03:02:57,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 03:02:57,864 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-20 03:02:57,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-20 03:02:57,865 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-20 03:02:57,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-20 03:02:57,865 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-20 03:02:57,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-20 03:02:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 03:02:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-20 03:02:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 03:02:57,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 03:02:57,869 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:03:01,040 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 03:03:01,040 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-20 03:03:01,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:03:01 BoogieIcfgContainer [2020-10-20 03:03:01,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 03:03:01,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 03:03:01,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 03:03:01,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 03:03:01,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 03:02:56" (1/3) ... [2020-10-20 03:03:01,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@683b7bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 03:03:01, skipping insertion in model container [2020-10-20 03:03:01,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:02:57" (2/3) ... [2020-10-20 03:03:01,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@683b7bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 03:03:01, skipping insertion in model container [2020-10-20 03:03:01,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:03:01" (3/3) ... [2020-10-20 03:03:01,057 INFO L111 eAbstractionObserver]: Analyzing ICFG safe003_power.opt.i [2020-10-20 03:03:01,068 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-20 03:03:01,068 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 03:03:01,076 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-20 03:03:01,077 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-20 03:03:01,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,120 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,121 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,121 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:03:01,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:03:01,121 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,122 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:03:01,122 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:03:01,123 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:03:01,123 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,123 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:03:01,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,126 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,127 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,144 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,144 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,144 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,144 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,144 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,144 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,160 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,160 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,166 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,167 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:03:01,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,167 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:03:01,168 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,168 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,183 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,185 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,187 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,188 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:01,190 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-20 03:03:01,203 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-20 03:03:01,223 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 03:03:01,223 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 03:03:01,223 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 03:03:01,223 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 03:03:01,224 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 03:03:01,224 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 03:03:01,224 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 03:03:01,224 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 03:03:01,237 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-20 03:03:01,240 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 120 transitions, 255 flow [2020-10-20 03:03:01,242 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 120 transitions, 255 flow [2020-10-20 03:03:01,244 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 127 places, 120 transitions, 255 flow [2020-10-20 03:03:01,314 INFO L129 PetriNetUnfolder]: 3/117 cut-off events. [2020-10-20 03:03:01,314 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-20 03:03:01,319 INFO L80 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2020-10-20 03:03:01,323 INFO L117 LiptonReduction]: Number of co-enabled transitions 1870 [2020-10-20 03:03:01,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:01,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:01,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:01,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:01,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:01,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:01,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:01,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:01,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:01,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:01,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:01,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:01,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:01,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:01,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:01,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:01,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:01,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:01,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:01,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:01,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:01,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:01,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:01,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:01,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:01,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:01,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:01,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:01,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:01,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:01,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:01,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:01,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:01,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:01,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:01,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:01,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:01,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:01,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:01,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:01,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:01,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:01,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:01,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:01,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:01,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:01,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:01,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:01,945 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2020-10-20 03:03:01,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:01,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:01,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:01,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 03:03:02,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:02,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:02,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 4, 2, 1] term [2020-10-20 03:03:02,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:02,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:02,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:02,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:02,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:02,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:02,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:02,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:02,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:02,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 3, 2, 5, 4, 5, 4, 1] term [2020-10-20 03:03:02,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:03:02,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 5, 4, 5, 4, 5, 4, 1] term [2020-10-20 03:03:02,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:03:02,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-20 03:03:02,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:03:02,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 4, 5, 4, 3, 2, 5, 4, 5, 4, 1] term [2020-10-20 03:03:02,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:03:02,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 4, 3, 2, 3, 2, 5, 4, 5, 4, 1] term [2020-10-20 03:03:02,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:03:02,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 7, 2, 6, 2, 6, 2, 7, 4, 5, 4, 1] term [2020-10-20 03:03:02,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:02,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:02,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:02,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 3, 2, 4, 2, 5, 4, 6, 4, 6, 4, 5, 4, 1] term [2020-10-20 03:03:02,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 03:03:02,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 12, 2, 11, 2, 10, 4, 8, 4, 5, 4, 1] term [2020-10-20 03:03:02,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:02,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:03:02,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 4, 2, 1] term [2020-10-20 03:03:02,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:02,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 03:03:02,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:02,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:02,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:02,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:02,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:02,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:02,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:02,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:02,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:02,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:02,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:02,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:02,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:02,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:02,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:02,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:02,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:02,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:02,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:02,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:02,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:02,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:02,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:02,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:02,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:02,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:02,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:02,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:02,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:02,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:02,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:06,943 WARN L193 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 406 DAG size of output: 364 [2020-10-20 03:03:06,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:03:06,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:06,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 5, 2, 4, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:03:06,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:06,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 2, 2, 3, 3, 3, 2, 1] term [2020-10-20 03:03:06,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:06,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 3, 3, 2, 1] term [2020-10-20 03:03:06,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:06,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 3, 2, 1] term [2020-10-20 03:03:06,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:06,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:06,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,241 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 198 DAG size of output: 174 [2020-10-20 03:03:08,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:08,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:08,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:08,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:08,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:08,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:08,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:08,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:08,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:08,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:08,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:08,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:08,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:08,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:08,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:08,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:08,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:08,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:08,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:08,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:08,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:08,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:08,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:08,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:08,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:08,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:08,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:08,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:08,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:08,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:08,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:08,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:08,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 4, 2, 1] term [2020-10-20 03:03:08,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:08,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 03:03:08,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:08,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:08,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,773 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-20 03:03:08,885 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-20 03:03:08,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:08,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:08,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 03:03:08,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 4, 2, 1] term [2020-10-20 03:03:08,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:08,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 03:03:08,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:08,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:08,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 4, 2, 1] term [2020-10-20 03:03:08,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:08,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:08,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:09,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:09,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:09,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:09,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:09,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:09,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:09,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:09,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:09,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:09,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:09,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:09,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 4, 2, 1] term [2020-10-20 03:03:09,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:09,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 03:03:09,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:09,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:09,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:09,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:09,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:09,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:09,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:09,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:09,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:09,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:09,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:09,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:09,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:09,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:09,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 3, 2, 2, 2, 1] term [2020-10-20 03:03:09,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:09,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 3, 3, 2, 2, 2, 1] term [2020-10-20 03:03:09,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:09,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 2, 2, 2, 1] term [2020-10-20 03:03:09,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:09,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-20 03:03:09,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:09,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-20 03:03:09,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:09,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-20 03:03:09,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:09,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-20 03:03:09,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:09,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-20 03:03:09,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:09,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 1] term [2020-10-20 03:03:09,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-20 03:03:09,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:09,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:09,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:09,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:09,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:09,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:09,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:09,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:09,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:09,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:09,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:09,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:09,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:09,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:09,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:09,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:09,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:09,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:09,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:09,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:09,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:09,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:09,901 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:09,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:09,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:09,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:10,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:10,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:10,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:10,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:10,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:10,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:10,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:10,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:10,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:10,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:10,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:10,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:10,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:10,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:10,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:10,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:10,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:10,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:10,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:10,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:10,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:10,228 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:10,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,228 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:10,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:10,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:10,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:10,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:10,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:10,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:10,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:10,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:10,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:10,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:10,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:10,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:10,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:10,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:10,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:10,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:10,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:10,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:10,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:10,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:10,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:10,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:10,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:10,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:10,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:10,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:10,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:10,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:10,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:10,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:10,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:10,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:10,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:10,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:03:10,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 2, 1] term [2020-10-20 03:03:10,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:03:10,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 2, 1] term [2020-10-20 03:03:10,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:03:10,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 3, 3, 2, 2, 1] term [2020-10-20 03:03:10,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:10,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-20 03:03:10,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:10,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 3, 3, 2, 3, 2, 2, 1] term [2020-10-20 03:03:10,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:10,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-20 03:03:10,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:10,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 2, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-20 03:03:10,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:10,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-20 03:03:10,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:10,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-20 03:03:10,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:10,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:10,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:10,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:10,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:10,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:10,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:10,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:10,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:10,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:10,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:10,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:10,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 2, 2, 5, 2, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1] term [2020-10-20 03:03:10,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:10,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 3, 2, 3, 2, 3, 3, 3, 3, 3, 2, 1] term [2020-10-20 03:03:10,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:10,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:10,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:10,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:10,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:10,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:11,859 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-20 03:03:11,989 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-10-20 03:03:12,260 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2020-10-20 03:03:12,377 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-10-20 03:03:13,135 WARN L193 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 159 [2020-10-20 03:03:13,544 WARN L193 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2020-10-20 03:03:13,552 INFO L132 LiptonReduction]: Checked pairs total: 5893 [2020-10-20 03:03:13,553 INFO L134 LiptonReduction]: Total number of compositions: 105 [2020-10-20 03:03:13,564 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-10-20 03:03:13,638 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 974 states. [2020-10-20 03:03:13,641 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states. [2020-10-20 03:03:13,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-10-20 03:03:13,646 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:13,647 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-10-20 03:03:13,648 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:03:13,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:13,652 INFO L82 PathProgramCache]: Analyzing trace with hash 46314852, now seen corresponding path program 1 times [2020-10-20 03:03:13,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:13,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405466840] [2020-10-20 03:03:13,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:13,886 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:03:13,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405466840] [2020-10-20 03:03:13,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:13,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-20 03:03:13,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246337218] [2020-10-20 03:03:13,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 03:03:13,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:13,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 03:03:13,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:03:13,910 INFO L87 Difference]: Start difference. First operand 974 states. Second operand 3 states. [2020-10-20 03:03:14,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:14,012 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-10-20 03:03:14,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:03:14,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-10-20 03:03:14,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:14,040 INFO L225 Difference]: With dead ends: 812 [2020-10-20 03:03:14,040 INFO L226 Difference]: Without dead ends: 687 [2020-10-20 03:03:14,042 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:03:14,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-10-20 03:03:14,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2020-10-20 03:03:14,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2020-10-20 03:03:14,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2020-10-20 03:03:14,147 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 4 [2020-10-20 03:03:14,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:14,147 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2020-10-20 03:03:14,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 03:03:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2020-10-20 03:03:14,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 03:03:14,150 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:14,150 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:14,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 03:03:14,151 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:03:14,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:14,151 INFO L82 PathProgramCache]: Analyzing trace with hash -223657198, now seen corresponding path program 1 times [2020-10-20 03:03:14,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:14,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090326826] [2020-10-20 03:03:14,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:14,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:03:14,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090326826] [2020-10-20 03:03:14,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:14,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:03:14,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371323162] [2020-10-20 03:03:14,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:03:14,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:14,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:03:14,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:03:14,296 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand 5 states. [2020-10-20 03:03:14,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:14,413 INFO L93 Difference]: Finished difference Result 712 states and 2140 transitions. [2020-10-20 03:03:14,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:03:14,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-20 03:03:14,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:14,424 INFO L225 Difference]: With dead ends: 712 [2020-10-20 03:03:14,426 INFO L226 Difference]: Without dead ends: 587 [2020-10-20 03:03:14,428 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:03:14,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-10-20 03:03:14,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2020-10-20 03:03:14,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2020-10-20 03:03:14,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1790 transitions. [2020-10-20 03:03:14,481 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1790 transitions. Word has length 10 [2020-10-20 03:03:14,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:14,482 INFO L481 AbstractCegarLoop]: Abstraction has 587 states and 1790 transitions. [2020-10-20 03:03:14,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:03:14,483 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1790 transitions. [2020-10-20 03:03:14,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-20 03:03:14,487 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:14,487 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:14,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 03:03:14,488 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:03:14,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:14,488 INFO L82 PathProgramCache]: Analyzing trace with hash -224137400, now seen corresponding path program 1 times [2020-10-20 03:03:14,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:14,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614527595] [2020-10-20 03:03:14,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:14,867 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-10-20 03:03:14,869 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:03:14,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614527595] [2020-10-20 03:03:14,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:14,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 03:03:14,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014431957] [2020-10-20 03:03:14,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 03:03:14,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:14,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 03:03:14,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:03:14,871 INFO L87 Difference]: Start difference. First operand 587 states and 1790 transitions. Second operand 6 states. [2020-10-20 03:03:15,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:15,047 INFO L93 Difference]: Finished difference Result 1238 states and 3664 transitions. [2020-10-20 03:03:15,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 03:03:15,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-10-20 03:03:15,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:15,052 INFO L225 Difference]: With dead ends: 1238 [2020-10-20 03:03:15,052 INFO L226 Difference]: Without dead ends: 623 [2020-10-20 03:03:15,053 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-10-20 03:03:15,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-10-20 03:03:15,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 407. [2020-10-20 03:03:15,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-10-20 03:03:15,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1151 transitions. [2020-10-20 03:03:15,068 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1151 transitions. Word has length 12 [2020-10-20 03:03:15,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:15,068 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 1151 transitions. [2020-10-20 03:03:15,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 03:03:15,069 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1151 transitions. [2020-10-20 03:03:15,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 03:03:15,074 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:15,074 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:15,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 03:03:15,074 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:03:15,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:15,075 INFO L82 PathProgramCache]: Analyzing trace with hash -566394790, now seen corresponding path program 1 times [2020-10-20 03:03:15,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:15,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64552338] [2020-10-20 03:03:15,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:15,275 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:03:15,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64552338] [2020-10-20 03:03:15,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:15,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:03:15,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485816560] [2020-10-20 03:03:15,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:03:15,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:15,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:03:15,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:03:15,277 INFO L87 Difference]: Start difference. First operand 407 states and 1151 transitions. Second operand 4 states. [2020-10-20 03:03:15,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:15,313 INFO L93 Difference]: Finished difference Result 614 states and 1715 transitions. [2020-10-20 03:03:15,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 03:03:15,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-20 03:03:15,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:15,316 INFO L225 Difference]: With dead ends: 614 [2020-10-20 03:03:15,316 INFO L226 Difference]: Without dead ends: 281 [2020-10-20 03:03:15,316 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:03:15,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-10-20 03:03:15,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2020-10-20 03:03:15,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2020-10-20 03:03:15,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 794 transitions. [2020-10-20 03:03:15,325 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 794 transitions. Word has length 14 [2020-10-20 03:03:15,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:15,325 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 794 transitions. [2020-10-20 03:03:15,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:03:15,326 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 794 transitions. [2020-10-20 03:03:15,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 03:03:15,327 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:15,327 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:15,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 03:03:15,327 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:03:15,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:15,328 INFO L82 PathProgramCache]: Analyzing trace with hash -379206590, now seen corresponding path program 1 times [2020-10-20 03:03:15,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:15,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203541054] [2020-10-20 03:03:15,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:15,645 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:03:15,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203541054] [2020-10-20 03:03:15,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:15,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 03:03:15,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443447601] [2020-10-20 03:03:15,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 03:03:15,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:15,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 03:03:15,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-20 03:03:15,647 INFO L87 Difference]: Start difference. First operand 281 states and 794 transitions. Second operand 9 states. [2020-10-20 03:03:16,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:16,072 INFO L93 Difference]: Finished difference Result 313 states and 855 transitions. [2020-10-20 03:03:16,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:03:16,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-20 03:03:16,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:16,075 INFO L225 Difference]: With dead ends: 313 [2020-10-20 03:03:16,075 INFO L226 Difference]: Without dead ends: 277 [2020-10-20 03:03:16,076 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:03:16,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-10-20 03:03:16,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2020-10-20 03:03:16,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2020-10-20 03:03:16,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 778 transitions. [2020-10-20 03:03:16,087 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 778 transitions. Word has length 15 [2020-10-20 03:03:16,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:16,088 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 778 transitions. [2020-10-20 03:03:16,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 03:03:16,088 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 778 transitions. [2020-10-20 03:03:16,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:03:16,090 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:16,090 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:16,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 03:03:16,091 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:03:16,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:16,091 INFO L82 PathProgramCache]: Analyzing trace with hash -272352167, now seen corresponding path program 1 times [2020-10-20 03:03:16,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:16,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261140189] [2020-10-20 03:03:16,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:16,612 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:03:16,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261140189] [2020-10-20 03:03:16,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:16,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 03:03:16,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137154783] [2020-10-20 03:03:16,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 03:03:16,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:16,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 03:03:16,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-20 03:03:16,615 INFO L87 Difference]: Start difference. First operand 277 states and 778 transitions. Second operand 9 states. [2020-10-20 03:03:17,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:17,027 INFO L93 Difference]: Finished difference Result 329 states and 909 transitions. [2020-10-20 03:03:17,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 03:03:17,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-20 03:03:17,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:17,030 INFO L225 Difference]: With dead ends: 329 [2020-10-20 03:03:17,030 INFO L226 Difference]: Without dead ends: 293 [2020-10-20 03:03:17,030 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2020-10-20 03:03:17,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2020-10-20 03:03:17,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 271. [2020-10-20 03:03:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2020-10-20 03:03:17,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 749 transitions. [2020-10-20 03:03:17,040 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 749 transitions. Word has length 16 [2020-10-20 03:03:17,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:17,040 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 749 transitions. [2020-10-20 03:03:17,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 03:03:17,040 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 749 transitions. [2020-10-20 03:03:17,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 03:03:17,041 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:17,042 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:03:17,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 03:03:17,042 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:03:17,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:17,043 INFO L82 PathProgramCache]: Analyzing trace with hash 144779954, now seen corresponding path program 1 times [2020-10-20 03:03:17,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:17,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618774725] [2020-10-20 03:03:17,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:17,412 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:03:17,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618774725] [2020-10-20 03:03:17,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:17,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:03:17,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631677934] [2020-10-20 03:03:17,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:03:17,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:17,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:03:17,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:03:17,414 INFO L87 Difference]: Start difference. First operand 271 states and 749 transitions. Second operand 10 states. [2020-10-20 03:03:17,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:17,826 INFO L93 Difference]: Finished difference Result 318 states and 869 transitions. [2020-10-20 03:03:17,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 03:03:17,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2020-10-20 03:03:17,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:17,829 INFO L225 Difference]: With dead ends: 318 [2020-10-20 03:03:17,829 INFO L226 Difference]: Without dead ends: 300 [2020-10-20 03:03:17,830 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:03:17,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2020-10-20 03:03:17,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 290. [2020-10-20 03:03:17,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2020-10-20 03:03:17,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 806 transitions. [2020-10-20 03:03:17,840 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 806 transitions. Word has length 17 [2020-10-20 03:03:17,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:17,842 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 806 transitions. [2020-10-20 03:03:17,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:03:17,842 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 806 transitions. [2020-10-20 03:03:17,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 03:03:17,844 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:17,844 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:03:17,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 03:03:17,845 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:03:17,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:17,845 INFO L82 PathProgramCache]: Analyzing trace with hash 596941233, now seen corresponding path program 1 times [2020-10-20 03:03:17,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:17,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353881658] [2020-10-20 03:03:17,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:18,334 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:03:18,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353881658] [2020-10-20 03:03:18,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:18,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:03:18,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618848010] [2020-10-20 03:03:18,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:03:18,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:18,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:03:18,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:03:18,338 INFO L87 Difference]: Start difference. First operand 290 states and 806 transitions. Second operand 10 states. [2020-10-20 03:03:18,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:18,872 INFO L93 Difference]: Finished difference Result 312 states and 852 transitions. [2020-10-20 03:03:18,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 03:03:18,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2020-10-20 03:03:18,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:18,877 INFO L225 Difference]: With dead ends: 312 [2020-10-20 03:03:18,877 INFO L226 Difference]: Without dead ends: 294 [2020-10-20 03:03:18,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-20 03:03:18,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-10-20 03:03:18,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2020-10-20 03:03:18,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2020-10-20 03:03:18,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 812 transitions. [2020-10-20 03:03:18,887 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 812 transitions. Word has length 17 [2020-10-20 03:03:18,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:18,887 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 812 transitions. [2020-10-20 03:03:18,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:03:18,887 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 812 transitions. [2020-10-20 03:03:18,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 03:03:18,889 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:18,889 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:03:18,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 03:03:18,889 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:18,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:18,890 INFO L82 PathProgramCache]: Analyzing trace with hash 583118209, now seen corresponding path program 1 times [2020-10-20 03:03:18,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:18,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046631093] [2020-10-20 03:03:18,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:18,965 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:03:18,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046631093] [2020-10-20 03:03:18,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:18,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:03:18,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403971680] [2020-10-20 03:03:18,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:03:18,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:18,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:03:18,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:03:18,967 INFO L87 Difference]: Start difference. First operand 292 states and 812 transitions. Second operand 4 states. [2020-10-20 03:03:18,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:18,996 INFO L93 Difference]: Finished difference Result 280 states and 688 transitions. [2020-10-20 03:03:18,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 03:03:18,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-20 03:03:18,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:18,999 INFO L225 Difference]: With dead ends: 280 [2020-10-20 03:03:18,999 INFO L226 Difference]: Without dead ends: 211 [2020-10-20 03:03:19,000 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:03:19,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-10-20 03:03:19,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2020-10-20 03:03:19,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-10-20 03:03:19,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 508 transitions. [2020-10-20 03:03:19,006 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 508 transitions. Word has length 17 [2020-10-20 03:03:19,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:19,007 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 508 transitions. [2020-10-20 03:03:19,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:03:19,007 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 508 transitions. [2020-10-20 03:03:19,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 03:03:19,008 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:19,008 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:19,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 03:03:19,009 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:19,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:19,009 INFO L82 PathProgramCache]: Analyzing trace with hash 2114024525, now seen corresponding path program 1 times [2020-10-20 03:03:19,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:19,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500042351] [2020-10-20 03:03:19,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:19,377 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:03:19,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500042351] [2020-10-20 03:03:19,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:19,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 03:03:19,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421196406] [2020-10-20 03:03:19,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 03:03:19,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:19,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 03:03:19,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:03:19,379 INFO L87 Difference]: Start difference. First operand 211 states and 508 transitions. Second operand 12 states. [2020-10-20 03:03:19,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:19,940 INFO L93 Difference]: Finished difference Result 259 states and 619 transitions. [2020-10-20 03:03:19,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 03:03:19,942 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-10-20 03:03:19,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:19,944 INFO L225 Difference]: With dead ends: 259 [2020-10-20 03:03:19,944 INFO L226 Difference]: Without dead ends: 245 [2020-10-20 03:03:19,945 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2020-10-20 03:03:19,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2020-10-20 03:03:19,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 219. [2020-10-20 03:03:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-10-20 03:03:19,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 530 transitions. [2020-10-20 03:03:19,952 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 530 transitions. Word has length 18 [2020-10-20 03:03:19,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:19,953 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 530 transitions. [2020-10-20 03:03:19,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 03:03:19,953 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 530 transitions. [2020-10-20 03:03:19,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 03:03:19,954 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:19,954 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:19,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 03:03:19,954 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:19,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:19,955 INFO L82 PathProgramCache]: Analyzing trace with hash -351742307, now seen corresponding path program 1 times [2020-10-20 03:03:19,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:19,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935966259] [2020-10-20 03:03:19,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:20,038 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:03:20,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935966259] [2020-10-20 03:03:20,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:20,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 03:03:20,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624155900] [2020-10-20 03:03:20,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:03:20,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:20,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:03:20,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:03:20,041 INFO L87 Difference]: Start difference. First operand 219 states and 530 transitions. Second operand 5 states. [2020-10-20 03:03:20,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:20,085 INFO L93 Difference]: Finished difference Result 179 states and 380 transitions. [2020-10-20 03:03:20,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:03:20,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-20 03:03:20,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:20,087 INFO L225 Difference]: With dead ends: 179 [2020-10-20 03:03:20,087 INFO L226 Difference]: Without dead ends: 131 [2020-10-20 03:03:20,087 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:03:20,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-10-20 03:03:20,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2020-10-20 03:03:20,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-20 03:03:20,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 254 transitions. [2020-10-20 03:03:20,092 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 254 transitions. Word has length 18 [2020-10-20 03:03:20,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:20,092 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 254 transitions. [2020-10-20 03:03:20,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:03:20,092 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 254 transitions. [2020-10-20 03:03:20,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 03:03:20,093 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:20,093 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:20,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 03:03:20,094 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:20,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:20,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1772031798, now seen corresponding path program 1 times [2020-10-20 03:03:20,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:20,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801560508] [2020-10-20 03:03:20,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:20,745 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:03:20,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801560508] [2020-10-20 03:03:20,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:20,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-20 03:03:20,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798426145] [2020-10-20 03:03:20,746 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 03:03:20,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:20,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 03:03:20,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-10-20 03:03:20,747 INFO L87 Difference]: Start difference. First operand 127 states and 254 transitions. Second operand 11 states. [2020-10-20 03:03:21,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:21,154 INFO L93 Difference]: Finished difference Result 141 states and 280 transitions. [2020-10-20 03:03:21,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:03:21,154 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-10-20 03:03:21,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:21,155 INFO L225 Difference]: With dead ends: 141 [2020-10-20 03:03:21,155 INFO L226 Difference]: Without dead ends: 138 [2020-10-20 03:03:21,156 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:03:21,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-10-20 03:03:21,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 123. [2020-10-20 03:03:21,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-10-20 03:03:21,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 248 transitions. [2020-10-20 03:03:21,161 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 248 transitions. Word has length 20 [2020-10-20 03:03:21,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:21,161 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 248 transitions. [2020-10-20 03:03:21,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 03:03:21,161 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 248 transitions. [2020-10-20 03:03:21,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 03:03:21,162 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:21,162 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:21,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 03:03:21,163 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:21,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:21,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1258937855, now seen corresponding path program 1 times [2020-10-20 03:03:21,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:21,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418554076] [2020-10-20 03:03:21,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:21,250 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:03:21,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418554076] [2020-10-20 03:03:21,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:21,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 03:03:21,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042747568] [2020-10-20 03:03:21,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 03:03:21,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:21,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 03:03:21,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:03:21,252 INFO L87 Difference]: Start difference. First operand 123 states and 248 transitions. Second operand 6 states. [2020-10-20 03:03:21,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:21,301 INFO L93 Difference]: Finished difference Result 102 states and 204 transitions. [2020-10-20 03:03:21,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:03:21,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-20 03:03:21,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:21,309 INFO L225 Difference]: With dead ends: 102 [2020-10-20 03:03:21,309 INFO L226 Difference]: Without dead ends: 91 [2020-10-20 03:03:21,309 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:03:21,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-10-20 03:03:21,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2020-10-20 03:03:21,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-10-20 03:03:21,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 166 transitions. [2020-10-20 03:03:21,313 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 166 transitions. Word has length 20 [2020-10-20 03:03:21,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:21,314 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 166 transitions. [2020-10-20 03:03:21,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 03:03:21,314 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 166 transitions. [2020-10-20 03:03:21,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:03:21,315 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:21,315 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:21,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 03:03:21,315 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:21,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:21,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1432841260, now seen corresponding path program 1 times [2020-10-20 03:03:21,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:21,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246797518] [2020-10-20 03:03:21,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 03:03:21,394 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 03:03:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 03:03:21,517 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 03:03:21,591 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 03:03:21,591 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 03:03:21,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 03:03:21,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:03:21,648 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,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:03:21,649 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,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:03:21,650 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,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:03:21,650 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,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:03:21,651 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,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:03:21,652 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,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:03:21,652 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,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:03:21,653 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,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:03:21,653 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,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:03:21,654 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,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:03:21,654 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,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:03:21,655 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,655 WARN 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:03:21,655 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,655 WARN 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:03:21,655 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,656 WARN 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:03:21,656 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,656 WARN 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:03:21,656 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,657 WARN 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:03:21,657 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,657 WARN 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:03:21,657 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,664 WARN 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:03:21,664 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,664 WARN 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:03:21,665 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,665 WARN 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:03:21,666 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,666 WARN 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:03:21,667 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,667 WARN 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:03:21,667 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,668 WARN 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:03:21,668 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,668 WARN 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:03:21,668 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,669 WARN 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:03:21,669 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,670 WARN 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:03:21,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,671 WARN 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:03:21,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,671 WARN 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:03:21,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,672 WARN 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:03:21,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,672 WARN 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:03:21,673 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,673 WARN 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:03:21,673 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,675 WARN 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:03:21,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,676 WARN 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:03:21,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,677 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:21,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,677 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:21,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,678 WARN 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:03:21,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,679 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:21,679 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_end() [761] [2020-10-20 03:03:21,680 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:21,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,680 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:21,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:21,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:21,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,682 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:21,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,682 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:21,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,683 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:21,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,683 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:21,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,684 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:21,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,684 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:21,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,685 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:21,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,685 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:21,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,685 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:21,686 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 03:03:21 BasicIcfg [2020-10-20 03:03:21,811 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 03:03:21,812 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 03:03:21,812 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 03:03:21,812 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 03:03:21,813 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:03:01" (3/4) ... [2020-10-20 03:03:21,815 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 03:03:21,836 WARN 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:03:21,837 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,837 WARN 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:03:21,837 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,837 WARN 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:03:21,838 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,838 WARN 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:03:21,838 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,838 WARN 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:03:21,838 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,839 WARN 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:03:21,839 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,839 WARN 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:03:21,839 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,839 WARN 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:03:21,840 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,840 WARN 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:03:21,840 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,840 WARN 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:03:21,841 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,841 WARN 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:03:21,841 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,841 WARN 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:03:21,841 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,841 WARN 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:03:21,842 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,842 WARN 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:03:21,842 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,842 WARN 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:03:21,842 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,843 WARN 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:03:21,843 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,843 WARN 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:03:21,843 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,843 WARN 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:03:21,844 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,844 WARN 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:03:21,844 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,844 WARN 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:03:21,844 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,845 WARN 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:03:21,845 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,845 WARN 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:03:21,845 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,845 WARN 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:03:21,846 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,846 WARN 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:03:21,846 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,846 WARN 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:03:21,846 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,846 WARN 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:03:21,847 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,847 WARN 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:03:21,847 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,847 WARN 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:03:21,848 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,848 WARN 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:03:21,848 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,848 WARN 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:03:21,848 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,848 WARN 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:03:21,849 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,849 WARN 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:03:21,849 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,850 WARN 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:03:21,850 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,850 WARN 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:03:21,850 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,850 WARN 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:03:21,850 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,851 WARN 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:03:21,851 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,851 WARN 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:03:21,851 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,851 WARN 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:03:21,852 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_end() [761] [2020-10-20 03:03:21,852 WARN 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:03:21,852 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,852 WARN 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:03:21,852 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,853 WARN 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:03:21,853 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,853 WARN 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:03:21,853 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,853 WARN 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:03:21,854 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,854 WARN 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:03:21,854 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,854 WARN 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:03:21,854 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,855 WARN 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:03:21,855 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,855 WARN 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:03:21,855 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,855 WARN 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:03:21,855 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,856 WARN 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:03:21,856 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,856 WARN 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:03:21,856 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,856 WARN 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:03:21,857 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:21,993 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 03:03:21,993 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 03:03:21,995 INFO L168 Benchmark]: Toolchain (without parser) took 25228.66 ms. Allocated memory was 35.1 MB in the beginning and 192.4 MB in the end (delta: 157.3 MB). Free memory was 11.6 MB in the beginning and 144.9 MB in the end (delta: -133.3 MB). Peak memory consumption was 153.1 MB. Max. memory is 14.3 GB. [2020-10-20 03:03:21,995 INFO L168 Benchmark]: CDTParser took 0.63 ms. Allocated memory is still 33.6 MB. Free memory was 19.1 MB in the beginning and 19.1 MB in the end (delta: 30.8 kB). Peak memory consumption was 30.8 kB. Max. memory is 14.3 GB. [2020-10-20 03:03:21,996 INFO L168 Benchmark]: CACSL2BoogieTranslator took 903.57 ms. Allocated memory was 35.1 MB in the beginning and 45.6 MB in the end (delta: 10.5 MB). Free memory was 10.7 MB in the beginning and 22.8 MB in the end (delta: -12.1 MB). Peak memory consumption was 11.9 MB. Max. memory is 14.3 GB. [2020-10-20 03:03:21,996 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.62 ms. Allocated memory is still 45.6 MB. Free memory was 22.8 MB in the beginning and 20.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 14.3 GB. [2020-10-20 03:03:21,996 INFO L168 Benchmark]: Boogie Preprocessor took 59.93 ms. Allocated memory is still 45.6 MB. Free memory was 20.0 MB in the beginning and 17.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 14.3 GB. [2020-10-20 03:03:21,997 INFO L168 Benchmark]: RCFGBuilder took 3248.98 ms. Allocated memory was 45.6 MB in the beginning and 87.6 MB in the end (delta: 41.9 MB). Free memory was 16.8 MB in the beginning and 44.8 MB in the end (delta: -28.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 14.3 GB. [2020-10-20 03:03:21,997 INFO L168 Benchmark]: TraceAbstraction took 20763.95 ms. Allocated memory was 87.6 MB in the beginning and 191.9 MB in the end (delta: 104.3 MB). Free memory was 44.8 MB in the beginning and 42.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 106.5 MB. Max. memory is 14.3 GB. [2020-10-20 03:03:21,998 INFO L168 Benchmark]: Witness Printer took 181.43 ms. Allocated memory was 191.9 MB in the beginning and 192.4 MB in the end (delta: 524.3 kB). Free memory was 42.6 MB in the beginning and 144.9 MB in the end (delta: -102.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 14.3 GB. [2020-10-20 03:03:22,001 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.63 ms. Allocated memory is still 33.6 MB. Free memory was 19.1 MB in the beginning and 19.1 MB in the end (delta: 30.8 kB). Peak memory consumption was 30.8 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 903.57 ms. Allocated memory was 35.1 MB in the beginning and 45.6 MB in the end (delta: 10.5 MB). Free memory was 10.7 MB in the beginning and 22.8 MB in the end (delta: -12.1 MB). Peak memory consumption was 11.9 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 60.62 ms. Allocated memory is still 45.6 MB. Free memory was 22.8 MB in the beginning and 20.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 59.93 ms. Allocated memory is still 45.6 MB. Free memory was 20.0 MB in the beginning and 17.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 14.3 GB. * RCFGBuilder took 3248.98 ms. Allocated memory was 45.6 MB in the beginning and 87.6 MB in the end (delta: 41.9 MB). Free memory was 16.8 MB in the beginning and 44.8 MB in the end (delta: -28.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 14.3 GB. * TraceAbstraction took 20763.95 ms. Allocated memory was 87.6 MB in the beginning and 191.9 MB in the end (delta: 104.3 MB). Free memory was 44.8 MB in the beginning and 42.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 106.5 MB. Max. memory is 14.3 GB. * Witness Printer took 181.43 ms. Allocated memory was 191.9 MB in the beginning and 192.4 MB in the end (delta: 524.3 kB). Free memory was 42.6 MB in the beginning and 144.9 MB in the end (delta: -102.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1158 VarBasedMoverChecksPositive, 79 VarBasedMoverChecksNegative, 22 SemBasedMoverChecksPositive, 57 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 142 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 12.3s, 127 PlacesBefore, 37 PlacesAfterwards, 120 TransitionsBefore, 28 TransitionsAfterwards, 1870 CoEnabledTransitionPairs, 8 FixpointIterations, 54 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 105 TotalNumberOfCompositions, 5893 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_p1_EAX = 0; [L712] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L713] 0 int __unbuffered_p1_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L722] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L723] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L724] 0 int __unbuffered_p1_EAX$w_buff0; [L725] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L726] 0 int __unbuffered_p1_EAX$w_buff1; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L729] 0 int __unbuffered_p2_EAX = 0; [L731] 0 int __unbuffered_p2_EBX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1852; [L854] FCALL, FORK 0 pthread_create(&t1852, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L855] 0 pthread_t t1853; [L856] FCALL, FORK 0 pthread_create(&t1853, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L794] EXPR 2 x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L794] EXPR 2 weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1) [L794] EXPR 2 \read(x) [L794] EXPR 2 weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1) [L794] EXPR 2 x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L796] EXPR 2 !x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))) [L796] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L796] EXPR 2 !x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))) [L796] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L797] EXPR 2 !x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0))) [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)) [L797] EXPR 2 x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0) [L797] EXPR 2 x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0 [L797] EXPR 2 x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0) [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)) [L797] EXPR 2 !x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0))) [L797] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L798] EXPR 2 !x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))) [L798] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] EXPR 2 !x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))) [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L799] EXPR 2 x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L799] EXPR 2 x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0 [L799] EXPR 2 x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L799] EXPR 2 !x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))) [L799] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] EXPR 2 !x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))) [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L800] EXPR 2 x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L800] EXPR 2 x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0 [L800] EXPR 2 x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L800] EXPR 2 !x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))) [L800] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 \read(x) [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={7:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=255, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L808] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={7:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=255, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L857] 0 pthread_t t1854; [L858] FCALL, FORK 0 pthread_create(&t1854, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={7:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=255, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L825] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={7:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=255, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L828] 3 __unbuffered_p2_EBX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={7:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=255, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] 1 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={7:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=255, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={7:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=255, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L775] EXPR 1 \read(x) [L775] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe003_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={7:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=255, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.3s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.4s, HoareTripleCheckerStatistics: 282 SDtfs, 459 SDslu, 854 SDs, 0 SdLazy, 1112 SolverSat, 196 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 303 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 185 ConstructedInterpolants, 0 QuantifiedInterpolants, 57025 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...