/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/podwr001_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:56:28,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:56:28,673 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:56:28,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:56:28,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:56:28,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:56:28,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:56:28,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:56:28,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:56:28,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:56:28,702 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:56:28,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:56:28,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:56:28,705 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:56:28,706 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:56:28,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:56:28,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:56:28,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:56:28,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:56:28,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:56:28,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:56:28,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:56:28,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:56:28,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:56:28,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:56:28,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:56:28,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:56:28,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:56:28,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:56:28,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:56:28,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:56:28,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:56:28,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:56:28,723 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:56:28,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:56:28,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:56:28,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:56:28,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:56:28,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:56:28,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:56:28,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:56:28,730 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf [2020-10-16 04:56:28,773 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:56:28,773 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:56:28,777 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:56:28,777 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:56:28,777 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:56:28,778 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:56:28,778 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:56:28,778 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:56:28,778 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:56:28,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:56:28,778 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:56:28,779 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:56:28,779 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:56:28,779 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:56:28,779 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:56:28,779 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:56:28,780 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:56:28,780 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:56:28,780 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:56:28,780 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:56:28,780 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:56:28,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:56:28,781 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:56:28,783 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:56:28,783 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:56:28,783 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:56:28,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:56:28,784 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:56:28,784 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:56:29,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:56:29,076 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:56:29,080 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:56:29,081 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:56:29,081 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:56:29,082 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr001_rmo.opt.i [2020-10-16 04:56:29,152 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cbead59b/0cacaca7b530480f96cb603e1148e020/FLAG1cea517f8 [2020-10-16 04:56:29,676 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:56:29,678 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr001_rmo.opt.i [2020-10-16 04:56:29,702 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cbead59b/0cacaca7b530480f96cb603e1148e020/FLAG1cea517f8 [2020-10-16 04:56:29,887 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cbead59b/0cacaca7b530480f96cb603e1148e020 [2020-10-16 04:56:29,897 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:56:29,900 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:56:29,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:56:29,901 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:56:29,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:56:29,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:56:29" (1/1) ... [2020-10-16 04:56:29,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f48e7e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:56:29, skipping insertion in model container [2020-10-16 04:56:29,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:56:29" (1/1) ... [2020-10-16 04:56:29,916 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:56:29,978 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:56:30,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:56:30,456 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:56:30,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:56:30,596 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:56:30,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:56:30 WrapperNode [2020-10-16 04:56:30,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:56:30,598 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:56:30,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:56:30,598 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:56:30,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:56:30" (1/1) ... [2020-10-16 04:56:30,625 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:56:30" (1/1) ... [2020-10-16 04:56:30,656 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:56:30,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:56:30,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:56:30,657 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:56:30,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:56:30" (1/1) ... [2020-10-16 04:56:30,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:56:30" (1/1) ... [2020-10-16 04:56:30,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:56:30" (1/1) ... [2020-10-16 04:56:30,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:56:30" (1/1) ... [2020-10-16 04:56:30,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:56:30" (1/1) ... [2020-10-16 04:56:30,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:56:30" (1/1) ... [2020-10-16 04:56:30,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:56:30" (1/1) ... [2020-10-16 04:56:30,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:56:30,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:56:30,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:56:30,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:56:30,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:56:30" (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-16 04:56:30,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:56:30,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:56:30,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:56:30,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:56:30,812 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:56:30,812 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:56:30,813 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:56:30,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:56:30,814 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 04:56:30,814 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 04:56:30,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:56:30,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:56:30,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:56:30,819 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 04:56:32,839 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:56:32,839 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:56:32,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:56:32 BoogieIcfgContainer [2020-10-16 04:56:32,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:56:32,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:56:32,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:56:32,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:56:32,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:56:29" (1/3) ... [2020-10-16 04:56:32,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb57824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:56:32, skipping insertion in model container [2020-10-16 04:56:32,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:56:30" (2/3) ... [2020-10-16 04:56:32,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb57824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:56:32, skipping insertion in model container [2020-10-16 04:56:32,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:56:32" (3/3) ... [2020-10-16 04:56:32,849 INFO L111 eAbstractionObserver]: Analyzing ICFG podwr001_rmo.opt.i [2020-10-16 04:56:32,860 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:56:32,868 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:56:32,869 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:56:32,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,899 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,899 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,900 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,900 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,904 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,904 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,904 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,904 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,904 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,905 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,905 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,905 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,905 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,906 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,906 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,907 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,907 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,912 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,912 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,912 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,912 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,912 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,912 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,913 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,913 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,913 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,913 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,913 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,915 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,917 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,917 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,917 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,917 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,917 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,918 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,918 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,918 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,922 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,924 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,924 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,925 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,931 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,931 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,936 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,938 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:56:32,959 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 04:56:32,980 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:56:32,980 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:56:32,980 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:56:32,981 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:56:32,981 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:56:32,981 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:56:32,981 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:56:32,981 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:56:32,995 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 203 flow [2020-10-16 04:56:33,041 INFO L129 PetriNetUnfolder]: 2/91 cut-off events. [2020-10-16 04:56:33,041 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:56:33,046 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 04:56:33,046 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 94 transitions, 203 flow [2020-10-16 04:56:33,053 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 91 transitions, 191 flow [2020-10-16 04:56:33,055 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:56:33,058 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 91 transitions, 191 flow [2020-10-16 04:56:33,061 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 91 transitions, 191 flow [2020-10-16 04:56:33,061 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 191 flow [2020-10-16 04:56:33,116 INFO L129 PetriNetUnfolder]: 2/91 cut-off events. [2020-10-16 04:56:33,116 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:56:33,117 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 04:56:33,120 INFO L117 LiptonReduction]: Number of co-enabled transitions 1650 [2020-10-16 04:56:33,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:33,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:33,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:33,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:33,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:33,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:33,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:33,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:33,333 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:33,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:33,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:33,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:33,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:33,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:33,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:33,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:33,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:33,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:33,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:33,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:33,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:33,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:33,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:33,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:33,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:33,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:33,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:33,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:33,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:33,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:33,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:33,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:33,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:33,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:33,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:33,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:33,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:33,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:33,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:33,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:33,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:33,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:33,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:33,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:33,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:33,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:33,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:33,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:33,920 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 04:56:34,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:34,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:34,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:34,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:34,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:34,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:34,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:34,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:34,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:34,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:34,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:34,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:34,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:34,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:34,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:34,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:34,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:34,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:34,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:56:34,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:56:34,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:56:34,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:56:34,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:56:34,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:56:34,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:56:34,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:56:34,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:56:34,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:56:34,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:56:34,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:56:34,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:56:34,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:56:34,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:56:34,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:56:34,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:56:34,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:56:34,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:56:34,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:56:34,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:34,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:34,677 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:56:34,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:56:34,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:56:34,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:56:34,680 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:56:34,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:56:34,682 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:56:34,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:56:34,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:56:34,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:56:34,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:56:34,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:56:34,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:34,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:34,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:34,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:34,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:34,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:34,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:34,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:34,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:34,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:34,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:34,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:34,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:34,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:34,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:34,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:34,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:56:34,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:35,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:35,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:35,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:35,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:35,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:35,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:35,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:35,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:56:35,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:56:35,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:35,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:56:35,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:35,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:35,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:35,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:35,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:35,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:35,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:35,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:35,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:35,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:35,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:35,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:35,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:35,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:35,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:35,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:35,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:35,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:35,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:35,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:35,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:35,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:35,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:35,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:35,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:35,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:35,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:35,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:56:35,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:56:35,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:56:35,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:56:35,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:56:35,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:56:35,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:56:35,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:56:35,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:56:35,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:56:35,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:56:35,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:56:35,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:56:35,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:56:35,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:56:35,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:56:35,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:35,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:35,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:35,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:35,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:35,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:35,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:35,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:35,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:35,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:35,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:35,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:56:35,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:35,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:56:35,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:56:35,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:56:35,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:56:35,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:56:35,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:35,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:35,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:56:35,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:56:35,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:56:35,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:56:35,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:56:35,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:56:35,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:56:35,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:56:35,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:56:35,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:56:35,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:56:35,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:56:36,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:36,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:36,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:36,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:36,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:36,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:36,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:36,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:36,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:36,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:36,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:36,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:36,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:36,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:56:36,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:36,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:56:36,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:36,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:36,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:36,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:36,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:36,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:56:36,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:36,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:56:36,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:36,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:36,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:36,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:56:36,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:56:36,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:36,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:56:36,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:56:36,965 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2020-10-16 04:56:37,086 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-16 04:56:37,141 INFO L132 LiptonReduction]: Checked pairs total: 4708 [2020-10-16 04:56:37,142 INFO L134 LiptonReduction]: Total number of compositions: 80 [2020-10-16 04:56:37,152 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4093 [2020-10-16 04:56:37,163 INFO L129 PetriNetUnfolder]: 0/3 cut-off events. [2020-10-16 04:56:37,164 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:56:37,165 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:56:37,166 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2020-10-16 04:56:37,166 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-16 04:56:37,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:56:37,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1048932, now seen corresponding path program 1 times [2020-10-16 04:56:37,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:56:37,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379928028] [2020-10-16 04:56:37,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:56:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:56:37,376 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-16 04:56:37,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379928028] [2020-10-16 04:56:37,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:56:37,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:56:37,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364603655] [2020-10-16 04:56:37,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:56:37,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:56:37,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:56:37,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:56:37,407 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 174 [2020-10-16 04:56:37,409 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states. [2020-10-16 04:56:37,409 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:56:37,409 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 174 [2020-10-16 04:56:37,410 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:56:37,500 INFO L129 PetriNetUnfolder]: 49/135 cut-off events. [2020-10-16 04:56:37,500 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:56:37,501 INFO L80 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 135 events. 49/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 597 event pairs, 38 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 221. Up to 65 conditions per place. [2020-10-16 04:56:37,503 INFO L132 encePairwiseOnDemand]: 171/174 looper letters, 9 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2020-10-16 04:56:37,503 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 26 transitions, 83 flow [2020-10-16 04:56:37,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:56:37,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:56:37,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2020-10-16 04:56:37,521 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8505747126436781 [2020-10-16 04:56:37,521 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 444 transitions. [2020-10-16 04:56:37,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 444 transitions. [2020-10-16 04:56:37,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:56:37,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 444 transitions. [2020-10-16 04:56:37,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:56:37,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:56:37,538 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:56:37,541 INFO L185 Difference]: Start difference. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states and 444 transitions. [2020-10-16 04:56:37,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 26 transitions, 83 flow [2020-10-16 04:56:37,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 80 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 04:56:37,546 INFO L241 Difference]: Finished difference. Result has 31 places, 22 transitions, 54 flow [2020-10-16 04:56:37,549 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2020-10-16 04:56:37,550 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2020-10-16 04:56:37,550 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2020-10-16 04:56:37,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:56:37,550 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:56:37,550 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:56:37,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:56:37,551 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-16 04:56:37,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:56:37,551 INFO L82 PathProgramCache]: Analyzing trace with hash -890477152, now seen corresponding path program 1 times [2020-10-16 04:56:37,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:56:37,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867033620] [2020-10-16 04:56:37,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:56:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:56:37,683 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-16 04:56:37,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867033620] [2020-10-16 04:56:37,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:56:37,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:56:37,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506604437] [2020-10-16 04:56:37,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:56:37,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:56:37,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:56:37,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:56:37,688 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 174 [2020-10-16 04:56:37,688 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand 4 states. [2020-10-16 04:56:37,688 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:56:37,688 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 174 [2020-10-16 04:56:37,689 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:56:37,737 INFO L129 PetriNetUnfolder]: 28/86 cut-off events. [2020-10-16 04:56:37,738 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:56:37,738 INFO L80 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 86 events. 28/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 317 event pairs, 12 based on Foata normal form. 8/86 useless extension candidates. Maximal degree in co-relation 146. Up to 45 conditions per place. [2020-10-16 04:56:37,739 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 5 selfloop transitions, 4 changer transitions 7/32 dead transitions. [2020-10-16 04:56:37,739 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 106 flow [2020-10-16 04:56:37,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:56:37,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:56:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 733 transitions. [2020-10-16 04:56:37,744 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8425287356321839 [2020-10-16 04:56:37,744 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 733 transitions. [2020-10-16 04:56:37,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 733 transitions. [2020-10-16 04:56:37,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:56:37,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 733 transitions. [2020-10-16 04:56:37,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:56:37,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:56:37,750 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:56:37,750 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 5 states and 733 transitions. [2020-10-16 04:56:37,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 106 flow [2020-10-16 04:56:37,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 32 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:56:37,751 INFO L241 Difference]: Finished difference. Result has 36 places, 25 transitions, 86 flow [2020-10-16 04:56:37,751 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2020-10-16 04:56:37,752 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2020-10-16 04:56:37,752 INFO L481 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 86 flow [2020-10-16 04:56:37,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:56:37,752 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:56:37,753 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:56:37,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:56:37,753 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-16 04:56:37,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:56:37,753 INFO L82 PathProgramCache]: Analyzing trace with hash 880376264, now seen corresponding path program 1 times [2020-10-16 04:56:37,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:56:37,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704610147] [2020-10-16 04:56:37,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:56:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:56:37,904 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-16 04:56:37,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704610147] [2020-10-16 04:56:37,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:56:37,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:56:37,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581109442] [2020-10-16 04:56:37,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:56:37,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:56:37,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:56:37,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:56:37,908 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 174 [2020-10-16 04:56:37,909 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 86 flow. Second operand 5 states. [2020-10-16 04:56:37,909 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:56:37,909 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 174 [2020-10-16 04:56:37,909 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:56:37,971 INFO L129 PetriNetUnfolder]: 16/61 cut-off events. [2020-10-16 04:56:37,971 INFO L130 PetriNetUnfolder]: For 38/46 co-relation queries the response was YES. [2020-10-16 04:56:37,972 INFO L80 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 61 events. 16/61 cut-off events. For 38/46 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 170 event pairs, 2 based on Foata normal form. 11/67 useless extension candidates. Maximal degree in co-relation 170. Up to 35 conditions per place. [2020-10-16 04:56:37,973 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 5 selfloop transitions, 7 changer transitions 7/35 dead transitions. [2020-10-16 04:56:37,973 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 35 transitions, 182 flow [2020-10-16 04:56:37,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:56:37,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:56:37,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 879 transitions. [2020-10-16 04:56:37,977 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8419540229885057 [2020-10-16 04:56:37,977 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 879 transitions. [2020-10-16 04:56:37,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 879 transitions. [2020-10-16 04:56:37,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:56:37,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 879 transitions. [2020-10-16 04:56:37,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:56:37,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:56:37,982 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:56:37,982 INFO L185 Difference]: Start difference. First operand has 36 places, 25 transitions, 86 flow. Second operand 6 states and 879 transitions. [2020-10-16 04:56:37,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 35 transitions, 182 flow [2020-10-16 04:56:37,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 35 transitions, 176 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 04:56:37,985 INFO L241 Difference]: Finished difference. Result has 40 places, 28 transitions, 136 flow [2020-10-16 04:56:37,985 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=136, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2020-10-16 04:56:37,985 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2020-10-16 04:56:37,986 INFO L481 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 136 flow [2020-10-16 04:56:37,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:56:37,986 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:56:37,986 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:56:37,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:56:37,986 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-16 04:56:37,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:56:37,987 INFO L82 PathProgramCache]: Analyzing trace with hash 2142971769, now seen corresponding path program 1 times [2020-10-16 04:56:37,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:56:37,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369667763] [2020-10-16 04:56:37,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:56:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:56:38,091 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-16 04:56:38,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369667763] [2020-10-16 04:56:38,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:56:38,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:56:38,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644542524] [2020-10-16 04:56:38,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:56:38,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:56:38,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:56:38,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:56:38,096 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 174 [2020-10-16 04:56:38,097 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 136 flow. Second operand 6 states. [2020-10-16 04:56:38,097 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:56:38,097 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 174 [2020-10-16 04:56:38,098 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:56:38,166 INFO L129 PetriNetUnfolder]: 7/37 cut-off events. [2020-10-16 04:56:38,166 INFO L130 PetriNetUnfolder]: For 66/82 co-relation queries the response was YES. [2020-10-16 04:56:38,167 INFO L80 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 37 events. 7/37 cut-off events. For 66/82 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 12/47 useless extension candidates. Maximal degree in co-relation 124. Up to 20 conditions per place. [2020-10-16 04:56:38,167 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 2 selfloop transitions, 10 changer transitions 5/32 dead transitions. [2020-10-16 04:56:38,167 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 32 transitions, 204 flow [2020-10-16 04:56:38,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:56:38,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:56:38,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1019 transitions. [2020-10-16 04:56:38,172 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8366174055829229 [2020-10-16 04:56:38,172 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1019 transitions. [2020-10-16 04:56:38,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1019 transitions. [2020-10-16 04:56:38,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:56:38,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1019 transitions. [2020-10-16 04:56:38,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:56:38,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:56:38,179 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:56:38,179 INFO L185 Difference]: Start difference. First operand has 40 places, 28 transitions, 136 flow. Second operand 7 states and 1019 transitions. [2020-10-16 04:56:38,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 32 transitions, 204 flow [2020-10-16 04:56:38,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 32 transitions, 168 flow, removed 14 selfloop flow, removed 4 redundant places. [2020-10-16 04:56:38,182 INFO L241 Difference]: Finished difference. Result has 43 places, 27 transitions, 136 flow [2020-10-16 04:56:38,182 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2020-10-16 04:56:38,182 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2020-10-16 04:56:38,183 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 136 flow [2020-10-16 04:56:38,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:56:38,183 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:56:38,183 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:56:38,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:56:38,184 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-16 04:56:38,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:56:38,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1879692361, now seen corresponding path program 1 times [2020-10-16 04:56:38,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:56:38,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167791992] [2020-10-16 04:56:38,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:56:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:56:38,290 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-16 04:56:38,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167791992] [2020-10-16 04:56:38,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:56:38,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:56:38,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735655696] [2020-10-16 04:56:38,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:56:38,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:56:38,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:56:38,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:56:38,295 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 174 [2020-10-16 04:56:38,296 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 136 flow. Second operand 4 states. [2020-10-16 04:56:38,296 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:56:38,296 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 174 [2020-10-16 04:56:38,297 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:56:38,369 INFO L129 PetriNetUnfolder]: 10/48 cut-off events. [2020-10-16 04:56:38,370 INFO L130 PetriNetUnfolder]: For 65/71 co-relation queries the response was YES. [2020-10-16 04:56:38,370 INFO L80 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 48 events. 10/48 cut-off events. For 65/71 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 110 event pairs, 0 based on Foata normal form. 1/45 useless extension candidates. Maximal degree in co-relation 136. Up to 21 conditions per place. [2020-10-16 04:56:38,371 INFO L132 encePairwiseOnDemand]: 171/174 looper letters, 3 selfloop transitions, 1 changer transitions 1/28 dead transitions. [2020-10-16 04:56:38,371 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 28 transitions, 148 flow [2020-10-16 04:56:38,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:56:38,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:56:38,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 570 transitions. [2020-10-16 04:56:38,376 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8189655172413793 [2020-10-16 04:56:38,376 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 570 transitions. [2020-10-16 04:56:38,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 570 transitions. [2020-10-16 04:56:38,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:56:38,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 570 transitions. [2020-10-16 04:56:38,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:56:38,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:56:38,380 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:56:38,381 INFO L185 Difference]: Start difference. First operand has 43 places, 27 transitions, 136 flow. Second operand 4 states and 570 transitions. [2020-10-16 04:56:38,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 28 transitions, 148 flow [2020-10-16 04:56:38,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 28 transitions, 110 flow, removed 12 selfloop flow, removed 6 redundant places. [2020-10-16 04:56:38,385 INFO L241 Difference]: Finished difference. Result has 39 places, 27 transitions, 105 flow [2020-10-16 04:56:38,386 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2020-10-16 04:56:38,386 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2020-10-16 04:56:38,386 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 105 flow [2020-10-16 04:56:38,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:56:38,386 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:56:38,386 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:56:38,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:56:38,387 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-16 04:56:38,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:56:38,387 INFO L82 PathProgramCache]: Analyzing trace with hash 910396025, now seen corresponding path program 2 times [2020-10-16 04:56:38,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:56:38,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009682834] [2020-10-16 04:56:38,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:56:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:56:38,470 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-16 04:56:38,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009682834] [2020-10-16 04:56:38,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:56:38,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:56:38,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911258892] [2020-10-16 04:56:38,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:56:38,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:56:38,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:56:38,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:56:38,473 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 174 [2020-10-16 04:56:38,474 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 105 flow. Second operand 4 states. [2020-10-16 04:56:38,474 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:56:38,475 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 174 [2020-10-16 04:56:38,475 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:56:38,500 INFO L129 PetriNetUnfolder]: 12/63 cut-off events. [2020-10-16 04:56:38,500 INFO L130 PetriNetUnfolder]: For 34/35 co-relation queries the response was YES. [2020-10-16 04:56:38,501 INFO L80 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 63 events. 12/63 cut-off events. For 34/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 199 event pairs, 0 based on Foata normal form. 1/61 useless extension candidates. Maximal degree in co-relation 140. Up to 19 conditions per place. [2020-10-16 04:56:38,502 INFO L132 encePairwiseOnDemand]: 171/174 looper letters, 3 selfloop transitions, 1 changer transitions 1/28 dead transitions. [2020-10-16 04:56:38,502 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 28 transitions, 117 flow [2020-10-16 04:56:38,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:56:38,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:56:38,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 570 transitions. [2020-10-16 04:56:38,505 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8189655172413793 [2020-10-16 04:56:38,505 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 570 transitions. [2020-10-16 04:56:38,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 570 transitions. [2020-10-16 04:56:38,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:56:38,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 570 transitions. [2020-10-16 04:56:38,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:56:38,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:56:38,508 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:56:38,509 INFO L185 Difference]: Start difference. First operand has 39 places, 27 transitions, 105 flow. Second operand 4 states and 570 transitions. [2020-10-16 04:56:38,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 28 transitions, 117 flow [2020-10-16 04:56:38,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 28 transitions, 114 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 04:56:38,513 INFO L241 Difference]: Finished difference. Result has 41 places, 27 transitions, 109 flow [2020-10-16 04:56:38,513 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2020-10-16 04:56:38,513 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2020-10-16 04:56:38,513 INFO L481 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 109 flow [2020-10-16 04:56:38,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:56:38,513 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:56:38,514 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:56:38,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:56:38,515 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-16 04:56:38,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:56:38,515 INFO L82 PathProgramCache]: Analyzing trace with hash 726379015, now seen corresponding path program 3 times [2020-10-16 04:56:38,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:56:38,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302000495] [2020-10-16 04:56:38,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:56:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:56:38,759 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-16 04:56:38,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302000495] [2020-10-16 04:56:38,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:56:38,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:56:38,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657308948] [2020-10-16 04:56:38,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:56:38,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:56:38,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:56:38,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:56:38,765 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 174 [2020-10-16 04:56:38,766 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 109 flow. Second operand 7 states. [2020-10-16 04:56:38,766 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:56:38,766 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 174 [2020-10-16 04:56:38,766 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:56:38,963 INFO L129 PetriNetUnfolder]: 37/128 cut-off events. [2020-10-16 04:56:38,963 INFO L130 PetriNetUnfolder]: For 53/54 co-relation queries the response was YES. [2020-10-16 04:56:38,964 INFO L80 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 128 events. 37/128 cut-off events. For 53/54 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 542 event pairs, 4 based on Foata normal form. 1/124 useless extension candidates. Maximal degree in co-relation 304. Up to 27 conditions per place. [2020-10-16 04:56:38,964 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 6 selfloop transitions, 4 changer transitions 7/36 dead transitions. [2020-10-16 04:56:38,965 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 36 transitions, 161 flow [2020-10-16 04:56:38,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:56:38,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:56:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 830 transitions. [2020-10-16 04:56:38,968 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6814449917898193 [2020-10-16 04:56:38,968 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 830 transitions. [2020-10-16 04:56:38,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 830 transitions. [2020-10-16 04:56:38,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:56:38,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 830 transitions. [2020-10-16 04:56:38,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:56:38,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:56:38,973 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:56:38,973 INFO L185 Difference]: Start difference. First operand has 41 places, 27 transitions, 109 flow. Second operand 7 states and 830 transitions. [2020-10-16 04:56:38,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 36 transitions, 161 flow [2020-10-16 04:56:38,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 36 transitions, 158 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 04:56:38,976 INFO L241 Difference]: Finished difference. Result has 46 places, 27 transitions, 120 flow [2020-10-16 04:56:38,976 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=120, PETRI_PLACES=46, PETRI_TRANSITIONS=27} [2020-10-16 04:56:38,976 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places. [2020-10-16 04:56:38,976 INFO L481 AbstractCegarLoop]: Abstraction has has 46 places, 27 transitions, 120 flow [2020-10-16 04:56:38,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:56:38,977 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:56:38,977 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:56:38,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:56:38,977 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-16 04:56:38,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:56:38,977 INFO L82 PathProgramCache]: Analyzing trace with hash 933219529, now seen corresponding path program 4 times [2020-10-16 04:56:38,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:56:38,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206891290] [2020-10-16 04:56:38,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:56:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:56:39,023 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:56:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:56:39,075 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:56:39,108 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:56:39,108 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:56:39,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:56:39,110 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 04:56:39,123 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L2-->L840: Formula: (let ((.cse9 (= (mod ~z$w_buff1_used~0_In-130533869 256) 0)) (.cse8 (= (mod ~z$r_buff1_thd0~0_In-130533869 256) 0)) (.cse7 (= (mod ~z$w_buff0_used~0_In-130533869 256) 0)) (.cse6 (= (mod ~z$r_buff0_thd0~0_In-130533869 256) 0))) (let ((.cse3 (not .cse6)) (.cse4 (not .cse7)) (.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse5 (or .cse6 .cse7))) (and (or (and (= ~z$w_buff1_used~0_Out-130533869 ~z$w_buff1_used~0_In-130533869) .cse0) (and (= ~z$w_buff1_used~0_Out-130533869 0) .cse1 .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-130533869 0)) (or (and .cse3 (= ~z$w_buff0_used~0_Out-130533869 0) .cse4) (and (= ~z$w_buff0_used~0_Out-130533869 ~z$w_buff0_used~0_In-130533869) .cse5)) (= ~z$r_buff0_thd0~0_In-130533869 ~z$r_buff0_thd0~0_Out-130533869) (or (and (= ~z~0_Out-130533869 ~z$w_buff0~0_In-130533869) .cse3 .cse4) (and (or (and .cse1 (= ~z$w_buff1~0_In-130533869 ~z~0_Out-130533869) .cse2) (and (= ~z~0_In-130533869 ~z~0_Out-130533869) .cse0)) .cse5)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-130533869 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-130533869|) (= ~z$r_buff1_thd0~0_In-130533869 ~z$r_buff1_thd0~0_Out-130533869)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-130533869|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-130533869, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-130533869, ~z$w_buff0~0=~z$w_buff0~0_In-130533869, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-130533869, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-130533869, ~z$w_buff1~0=~z$w_buff1~0_In-130533869, ~z~0=~z~0_In-130533869} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-130533869, ~z$w_buff0~0=~z$w_buff0~0_In-130533869, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-130533869, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-130533869|, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-130533869|, ~z$w_buff1~0=~z$w_buff1~0_In-130533869, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-130533869|, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-130533869|, ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-130533869|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-130533869|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-130533869, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-130533869|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-130533869, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-130533869, ~z~0=~z~0_Out-130533869} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2020-10-16 04:56:39,128 WARN 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-16 04:56:39,128 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,131 WARN 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-16 04:56:39,131 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,131 WARN 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-16 04:56:39,131 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,131 WARN 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-16 04:56:39,132 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,132 WARN 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-16 04:56:39,132 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,132 WARN 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-16 04:56:39,132 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,133 WARN 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-16 04:56:39,133 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,133 WARN 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-16 04:56:39,133 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,133 WARN 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-16 04:56:39,134 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,134 WARN 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-16 04:56:39,134 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,134 WARN 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-16 04:56:39,134 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,134 WARN 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-16 04:56:39,135 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,135 WARN 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-16 04:56:39,135 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,135 WARN 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-16 04:56:39,135 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,135 WARN 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-16 04:56:39,136 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,136 WARN 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-16 04:56:39,136 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,136 WARN 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-16 04:56:39,136 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,137 WARN 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-16 04:56:39,137 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,137 WARN 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-16 04:56:39,137 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,137 WARN 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-16 04:56:39,137 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,138 WARN 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-16 04:56:39,138 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,138 WARN 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-16 04:56:39,138 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,138 WARN 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-16 04:56:39,139 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,139 WARN 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-16 04:56:39,139 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,139 WARN 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-16 04:56:39,139 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,139 WARN 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-16 04:56:39,140 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,140 WARN 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-16 04:56:39,140 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,140 WARN 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-16 04:56:39,140 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,141 WARN 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-16 04:56:39,141 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,141 WARN 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-16 04:56:39,141 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:39,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:56:39 BasicIcfg [2020-10-16 04:56:39,198 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:56:39,200 INFO L168 Benchmark]: Toolchain (without parser) took 9299.70 ms. Allocated memory was 253.8 MB in the beginning and 502.3 MB in the end (delta: 248.5 MB). Free memory was 206.8 MB in the beginning and 317.4 MB in the end (delta: -110.6 MB). Peak memory consumption was 138.0 MB. Max. memory is 14.2 GB. [2020-10-16 04:56:39,200 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 253.8 MB. Free memory is still 227.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:56:39,201 INFO L168 Benchmark]: CACSL2BoogieTranslator took 696.01 ms. Allocated memory was 253.8 MB in the beginning and 320.3 MB in the end (delta: 66.6 MB). Free memory was 206.8 MB in the beginning and 272.7 MB in the end (delta: -65.9 MB). Peak memory consumption was 33.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:56:39,202 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.15 ms. Allocated memory is still 320.3 MB. Free memory was 272.7 MB in the beginning and 270.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:56:39,203 INFO L168 Benchmark]: Boogie Preprocessor took 46.01 ms. Allocated memory is still 320.3 MB. Free memory was 270.2 MB in the beginning and 267.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:56:39,204 INFO L168 Benchmark]: RCFGBuilder took 2138.07 ms. Allocated memory was 320.3 MB in the beginning and 360.7 MB in the end (delta: 40.4 MB). Free memory was 267.6 MB in the beginning and 189.8 MB in the end (delta: 77.8 MB). Peak memory consumption was 118.2 MB. Max. memory is 14.2 GB. [2020-10-16 04:56:39,205 INFO L168 Benchmark]: TraceAbstraction took 6355.29 ms. Allocated memory was 360.7 MB in the beginning and 502.3 MB in the end (delta: 141.6 MB). Free memory was 189.8 MB in the beginning and 317.4 MB in the end (delta: -127.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 14.2 GB. [2020-10-16 04:56:39,209 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 253.8 MB. Free memory is still 227.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 696.01 ms. Allocated memory was 253.8 MB in the beginning and 320.3 MB in the end (delta: 66.6 MB). Free memory was 206.8 MB in the beginning and 272.7 MB in the end (delta: -65.9 MB). Peak memory consumption was 33.5 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 59.15 ms. Allocated memory is still 320.3 MB. Free memory was 272.7 MB in the beginning and 270.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 46.01 ms. Allocated memory is still 320.3 MB. Free memory was 270.2 MB in the beginning and 267.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2138.07 ms. Allocated memory was 320.3 MB in the beginning and 360.7 MB in the end (delta: 40.4 MB). Free memory was 267.6 MB in the beginning and 189.8 MB in the end (delta: 77.8 MB). Peak memory consumption was 118.2 MB. Max. memory is 14.2 GB. * TraceAbstraction took 6355.29 ms. Allocated memory was 360.7 MB in the beginning and 502.3 MB in the end (delta: 141.6 MB). Free memory was 189.8 MB in the beginning and 317.4 MB in the end (delta: -127.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1061 VarBasedMoverChecksPositive, 63 VarBasedMoverChecksNegative, 4 SemBasedMoverChecksPositive, 59 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 124 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.0s, 99 PlacesBefore, 33 PlacesAfterwards, 91 TransitionsBefore, 23 TransitionsAfterwards, 1650 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 80 TotalNumberOfCompositions, 4708 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p0_EAX = 0; [L702] 0 int __unbuffered_p1_EAX = 0; [L704] 0 int __unbuffered_p2_EAX = 0; [L705] 0 _Bool main$tmp_guard0; [L706] 0 _Bool main$tmp_guard1; [L708] 0 int x = 0; [L710] 0 int y = 0; [L712] 0 int z = 0; [L713] 0 _Bool z$flush_delayed; [L714] 0 int z$mem_tmp; [L715] 0 _Bool z$r_buff0_thd0; [L716] 0 _Bool z$r_buff0_thd1; [L717] 0 _Bool z$r_buff0_thd2; [L718] 0 _Bool z$r_buff0_thd3; [L719] 0 _Bool z$r_buff1_thd0; [L720] 0 _Bool z$r_buff1_thd1; [L721] 0 _Bool z$r_buff1_thd2; [L722] 0 _Bool z$r_buff1_thd3; [L723] 0 _Bool z$read_delayed; [L724] 0 int *z$read_delayed_var; [L725] 0 int z$w_buff0; [L726] 0 _Bool z$w_buff0_used; [L727] 0 int z$w_buff1; [L728] 0 _Bool z$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L824] 0 pthread_t t1576; [L825] FCALL, FORK 0 pthread_create(&t1576, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$w_buff1 = z$w_buff0 [L735] 1 z$w_buff0 = 1 [L736] 1 z$w_buff1_used = z$w_buff0_used [L737] 1 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L739] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L740] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L741] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L742] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L743] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 0 pthread_t t1577; [L827] FCALL, FORK 0 pthread_create(&t1577, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 pthread_t t1578; [L829] FCALL, FORK 0 pthread_create(&t1578, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L794] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L794] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L795] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L795] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EAX = z [L798] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L798] 3 z = z$flush_delayed ? z$mem_tmp : z [L799] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L769] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L770] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L770] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L771] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L771] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L772] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L772] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L773] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L773] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L806] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L806] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L749] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L749] EXPR 1 z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z [L749] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L749] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L750] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L751] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L751] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L752] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L752] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L753] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L753] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L809] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L811] 3 return 0; [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 93 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 6.1s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 22 SDtfs, 15 SDslu, 16 SDs, 0 SdLazy, 169 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 7956 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...