/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/mix030_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:47:25,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:47:25,700 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:47:25,735 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:47:25,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:47:25,743 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:47:25,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:47:25,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:47:25,752 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:47:25,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:47:25,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:47:25,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:47:25,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:47:25,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:47:25,762 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:47:25,764 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:47:25,765 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:47:25,766 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:47:25,768 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:47:25,776 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:47:25,778 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:47:25,779 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:47:25,780 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:47:25,781 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:47:25,793 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:47:25,799 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:47:25,799 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:47:25,800 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:47:25,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:47:25,801 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:47:25,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:47:25,802 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:47:25,803 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:47:25,804 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:47:25,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:47:25,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:47:25,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:47:25,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:47:25,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:47:25,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:47:25,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:47:25,813 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:47:25,835 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:47:25,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:47:25,836 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:47:25,837 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:47:25,837 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:47:25,837 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:47:25,837 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:47:25,838 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:47:25,838 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:47:25,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:47:25,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:47:25,838 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:47:25,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:47:25,839 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:47:25,839 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:47:25,839 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:47:25,839 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:47:25,840 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:47:25,840 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:47:25,840 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:47:25,840 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:47:25,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:47:25,841 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:47:25,841 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:47:25,841 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:47:25,841 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:47:25,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:47:25,842 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:47:25,842 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:47:26,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:47:26,163 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:47:26,167 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:47:26,169 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:47:26,169 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:47:26,170 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.oepc.i [2020-10-16 04:47:26,225 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4581c0f71/e9c6bdde6d764789a01022208ed51009/FLAG0feff9e9f [2020-10-16 04:47:26,817 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:47:26,818 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_tso.oepc.i [2020-10-16 04:47:26,836 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4581c0f71/e9c6bdde6d764789a01022208ed51009/FLAG0feff9e9f [2020-10-16 04:47:27,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4581c0f71/e9c6bdde6d764789a01022208ed51009 [2020-10-16 04:47:27,069 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:47:27,071 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:47:27,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:47:27,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:47:27,076 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:47:27,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:47:27" (1/1) ... [2020-10-16 04:47:27,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a59b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:27, skipping insertion in model container [2020-10-16 04:47:27,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:47:27" (1/1) ... [2020-10-16 04:47:27,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:47:27,141 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:47:27,650 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:47:27,672 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:47:27,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:47:27,866 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:47:27,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:27 WrapperNode [2020-10-16 04:47:27,867 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:47:27,868 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:47:27,868 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:47:27,868 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:47:27,877 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:47:27" (1/1) ... [2020-10-16 04:47:27,900 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:47:27" (1/1) ... [2020-10-16 04:47:27,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:47:27,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:47:27,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:47:27,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:47:27,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:27" (1/1) ... [2020-10-16 04:47:27,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:27" (1/1) ... [2020-10-16 04:47:27,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:27" (1/1) ... [2020-10-16 04:47:27,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:27" (1/1) ... [2020-10-16 04:47:27,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:27" (1/1) ... [2020-10-16 04:47:27,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:27" (1/1) ... [2020-10-16 04:47:27,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:27" (1/1) ... [2020-10-16 04:47:27,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:47:27,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:47:27,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:47:27,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:47:27,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:27" (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:47:28,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:47:28,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:47:28,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:47:28,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:47:28,060 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:47:28,060 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:47:28,060 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:47:28,060 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:47:28,060 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 04:47:28,060 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 04:47:28,061 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 04:47:28,061 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 04:47:28,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:47:28,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:47:28,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:47:28,063 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:47:30,660 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:47:30,660 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:47:30,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:47:30 BoogieIcfgContainer [2020-10-16 04:47:30,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:47:30,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:47:30,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:47:30,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:47:30,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:47:27" (1/3) ... [2020-10-16 04:47:30,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f021e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:47:30, skipping insertion in model container [2020-10-16 04:47:30,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:27" (2/3) ... [2020-10-16 04:47:30,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f021e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:47:30, skipping insertion in model container [2020-10-16 04:47:30,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:47:30" (3/3) ... [2020-10-16 04:47:30,673 INFO L111 eAbstractionObserver]: Analyzing ICFG mix030_tso.oepc.i [2020-10-16 04:47:30,687 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:47:30,698 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:47:30,699 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:47:30,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,736 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,736 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,738 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,738 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,739 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,739 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,740 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,743 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,743 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,743 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,743 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,743 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,744 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,747 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,747 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,747 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,747 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,747 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,747 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,750 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,750 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,750 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,750 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,750 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,750 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,752 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,752 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,753 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,753 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,753 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,753 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,753 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,754 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,754 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,759 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,760 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,761 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,761 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,761 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,761 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,761 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,762 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,762 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,762 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,762 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,762 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,769 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,769 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,769 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,769 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,775 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,775 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,775 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,775 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,778 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,778 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,779 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:30,796 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 04:47:30,818 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:47:30,818 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:47:30,818 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:47:30,819 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:47:30,819 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:47:30,819 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:47:30,819 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:47:30,819 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:47:30,834 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 120 places, 109 transitions, 238 flow [2020-10-16 04:47:30,886 INFO L129 PetriNetUnfolder]: 2/105 cut-off events. [2020-10-16 04:47:30,887 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:47:30,892 INFO L80 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2020-10-16 04:47:30,893 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 109 transitions, 238 flow [2020-10-16 04:47:30,900 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 105 transitions, 222 flow [2020-10-16 04:47:30,902 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:47:30,905 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 105 transitions, 222 flow [2020-10-16 04:47:30,908 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 105 transitions, 222 flow [2020-10-16 04:47:30,909 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 116 places, 105 transitions, 222 flow [2020-10-16 04:47:30,937 INFO L129 PetriNetUnfolder]: 2/105 cut-off events. [2020-10-16 04:47:30,937 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:47:30,938 INFO L80 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2020-10-16 04:47:30,943 INFO L117 LiptonReduction]: Number of co-enabled transitions 2446 [2020-10-16 04:47:31,374 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-16 04:47:31,771 WARN L193 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 04:47:31,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:47:31,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:31,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:47:31,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:31,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:47:31,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:31,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:47:31,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:33,072 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-16 04:47:33,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-16 04:47:33,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:33,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:47:33,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:34,009 WARN L193 SmtUtils]: Spent 904.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 128 [2020-10-16 04:47:34,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:34,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:34,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:47:34,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:34,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:47:34,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:34,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:47:34,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:34,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:47:34,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:34,166 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:47:34,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:34,169 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:47:34,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:34,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:47:34,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:47:34,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:47:34,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:34,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:34,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:34,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:34,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:34,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:34,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:34,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:34,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:34,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:34,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:34,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:34,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:34,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:34,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:34,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:34,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:34,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:34,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:34,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:34,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:34,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:34,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:34,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:34,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:34,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:34,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:34,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:34,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:34,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:34,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:34,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:34,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:34,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:34,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:34,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:34,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47: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:47:34,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:34,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:34,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:34,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:34,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:34,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:34,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:34,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:34,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:34,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:34,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:34,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:47:34,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:35,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:47:35,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:47:35,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:47:35,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:35,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:35,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:35,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:47:35,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:35,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:47:35,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:35,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:47:35,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:35,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:47:35,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:35,358 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:47:35,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:35,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:47:35,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:35,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:35,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:35,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:47:35,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:35,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:47:35,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:35,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:47:35,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:35,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:47:35,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:35,893 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:47:35,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:35,896 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:47:35,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:35,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:47:35,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:47:35,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:47:35,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:36,264 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 04:47:36,396 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 04:47:36,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:47:36,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:47:36,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:47:36,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:36,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:36,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:36,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:47:36,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:36,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:47:36,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:36,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:47:36,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:36,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:47:36,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:36,759 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:47:36,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:36,760 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:47:36,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:37,536 WARN L193 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 110 [2020-10-16 04:47:37,866 WARN L193 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-16 04:47:37,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:37,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:37,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:37,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:37,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:37,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:37,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:37,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:37,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:37,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:37,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:37,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:37,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:37,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:37,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:37,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:37,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:37,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:37,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:37,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:37,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:37,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:37,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:37,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:37,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:37,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:37,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:37,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:37,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:37,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:37,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:37,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:38,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:38,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:38,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:38,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:38,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:38,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:38,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:38,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:47:38,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:38,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:47:38,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:38,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:47:38,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:47:38,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:47:38,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:38,096 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:47:38,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:38,101 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:47:38,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:38,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:47:38,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:47:38,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:47:38,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:38,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:38,228 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:38,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:38,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:38,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:38,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:38,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:38,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:39,181 WARN L193 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 132 [2020-10-16 04:47:39,502 WARN L193 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-16 04:47:40,745 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 137 DAG size of output: 136 [2020-10-16 04:47:41,382 WARN L193 SmtUtils]: Spent 634.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-16 04:47:41,644 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-16 04:47:41,776 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-16 04:47:41,887 INFO L132 LiptonReduction]: Checked pairs total: 6967 [2020-10-16 04:47:41,887 INFO L134 LiptonReduction]: Total number of compositions: 92 [2020-10-16 04:47:41,892 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10992 [2020-10-16 04:47:41,901 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2020-10-16 04:47:41,901 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:47:41,901 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:41,902 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:41,903 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:41,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:41,909 INFO L82 PathProgramCache]: Analyzing trace with hash -137982902, now seen corresponding path program 1 times [2020-10-16 04:47:41,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:41,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314031029] [2020-10-16 04:47:41,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:42,200 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:47:42,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314031029] [2020-10-16 04:47:42,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:42,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:47:42,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573781300] [2020-10-16 04:47:42,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:47:42,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:42,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:47:42,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:47:42,227 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 201 [2020-10-16 04:47:42,229 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states. [2020-10-16 04:47:42,230 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:42,230 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 201 [2020-10-16 04:47:42,231 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:42,338 INFO L129 PetriNetUnfolder]: 33/99 cut-off events. [2020-10-16 04:47:42,339 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:47:42,339 INFO L80 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 99 events. 33/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 369 event pairs, 3 based on Foata normal form. 8/99 useless extension candidates. Maximal degree in co-relation 167. Up to 55 conditions per place. [2020-10-16 04:47:42,341 INFO L132 encePairwiseOnDemand]: 197/201 looper letters, 8 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2020-10-16 04:47:42,342 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 98 flow [2020-10-16 04:47:42,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:47:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:47:42,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 516 transitions. [2020-10-16 04:47:42,361 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8557213930348259 [2020-10-16 04:47:42,362 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 516 transitions. [2020-10-16 04:47:42,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 516 transitions. [2020-10-16 04:47:42,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:42,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 516 transitions. [2020-10-16 04:47:42,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:47:42,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:47:42,381 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:47:42,384 INFO L185 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 516 transitions. [2020-10-16 04:47:42,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 98 flow [2020-10-16 04:47:42,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 94 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 04:47:42,390 INFO L241 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2020-10-16 04:47:42,393 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2020-10-16 04:47:42,393 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2020-10-16 04:47:42,394 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2020-10-16 04:47:42,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:47:42,394 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:42,394 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:42,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:47:42,395 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:42,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:42,395 INFO L82 PathProgramCache]: Analyzing trace with hash 542442462, now seen corresponding path program 1 times [2020-10-16 04:47:42,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:42,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110564679] [2020-10-16 04:47:42,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:42,562 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:47:42,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110564679] [2020-10-16 04:47:42,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:42,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:47:42,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361991172] [2020-10-16 04:47:42,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:47:42,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:42,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:47:42,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:47:42,571 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 201 [2020-10-16 04:47:42,572 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states. [2020-10-16 04:47:42,572 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:42,572 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 201 [2020-10-16 04:47:42,572 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:42,662 INFO L129 PetriNetUnfolder]: 112/232 cut-off events. [2020-10-16 04:47:42,663 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-16 04:47:42,664 INFO L80 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 232 events. 112/232 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1022 event pairs, 47 based on Foata normal form. 1/229 useless extension candidates. Maximal degree in co-relation 435. Up to 182 conditions per place. [2020-10-16 04:47:42,666 INFO L132 encePairwiseOnDemand]: 196/201 looper letters, 9 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2020-10-16 04:47:42,666 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 30 transitions, 100 flow [2020-10-16 04:47:42,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:47:42,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:47:42,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 476 transitions. [2020-10-16 04:47:42,670 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7893864013266998 [2020-10-16 04:47:42,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 476 transitions. [2020-10-16 04:47:42,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 476 transitions. [2020-10-16 04:47:42,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:42,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 476 transitions. [2020-10-16 04:47:42,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:47:42,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:47:42,674 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:47:42,674 INFO L185 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 476 transitions. [2020-10-16 04:47:42,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 30 transitions, 100 flow [2020-10-16 04:47:42,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:47:42,675 INFO L241 Difference]: Finished difference. Result has 38 places, 29 transitions, 86 flow [2020-10-16 04:47:42,676 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2020-10-16 04:47:42,676 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2020-10-16 04:47:42,677 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 86 flow [2020-10-16 04:47:42,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:47:42,677 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:42,677 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:42,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:47:42,677 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:42,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:42,678 INFO L82 PathProgramCache]: Analyzing trace with hash -364152957, now seen corresponding path program 1 times [2020-10-16 04:47:42,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:42,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000191456] [2020-10-16 04:47:42,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:42,757 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:47:42,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000191456] [2020-10-16 04:47:42,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:42,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:47:42,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008680364] [2020-10-16 04:47:42,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:47:42,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:42,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:47:42,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:47:42,761 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 201 [2020-10-16 04:47:42,761 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 86 flow. Second operand 3 states. [2020-10-16 04:47:42,761 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:42,762 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 201 [2020-10-16 04:47:42,762 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:42,926 INFO L129 PetriNetUnfolder]: 353/661 cut-off events. [2020-10-16 04:47:42,926 INFO L130 PetriNetUnfolder]: For 93/99 co-relation queries the response was YES. [2020-10-16 04:47:42,930 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1355 conditions, 661 events. 353/661 cut-off events. For 93/99 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3639 event pairs, 207 based on Foata normal form. 2/634 useless extension candidates. Maximal degree in co-relation 1345. Up to 475 conditions per place. [2020-10-16 04:47:42,936 INFO L132 encePairwiseOnDemand]: 196/201 looper letters, 11 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2020-10-16 04:47:42,936 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 135 flow [2020-10-16 04:47:42,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:47:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:47:42,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2020-10-16 04:47:42,939 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7910447761194029 [2020-10-16 04:47:42,939 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 477 transitions. [2020-10-16 04:47:42,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions. [2020-10-16 04:47:42,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:42,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions. [2020-10-16 04:47:42,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:47:42,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:47:42,942 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:47:42,942 INFO L185 Difference]: Start difference. First operand has 38 places, 29 transitions, 86 flow. Second operand 3 states and 477 transitions. [2020-10-16 04:47:42,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 135 flow [2020-10-16 04:47:42,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:47:42,945 INFO L241 Difference]: Finished difference. Result has 40 places, 33 transitions, 119 flow [2020-10-16 04:47:42,945 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2020-10-16 04:47:42,945 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2020-10-16 04:47:42,946 INFO L481 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 119 flow [2020-10-16 04:47:42,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:47:42,946 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:42,946 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:42,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:47:42,946 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:42,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:42,947 INFO L82 PathProgramCache]: Analyzing trace with hash -363745214, now seen corresponding path program 1 times [2020-10-16 04:47:42,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:42,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789040138] [2020-10-16 04:47:42,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:43,036 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:47:43,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789040138] [2020-10-16 04:47:43,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:43,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:47:43,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457457016] [2020-10-16 04:47:43,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:47:43,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:43,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:47:43,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:47:43,047 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 201 [2020-10-16 04:47:43,048 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 119 flow. Second operand 3 states. [2020-10-16 04:47:43,048 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:43,048 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 201 [2020-10-16 04:47:43,048 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:43,088 INFO L129 PetriNetUnfolder]: 39/138 cut-off events. [2020-10-16 04:47:43,088 INFO L130 PetriNetUnfolder]: For 123/173 co-relation queries the response was YES. [2020-10-16 04:47:43,089 INFO L80 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 138 events. 39/138 cut-off events. For 123/173 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 611 event pairs, 8 based on Foata normal form. 11/138 useless extension candidates. Maximal degree in co-relation 261. Up to 50 conditions per place. [2020-10-16 04:47:43,091 INFO L132 encePairwiseOnDemand]: 198/201 looper letters, 1 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2020-10-16 04:47:43,091 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 33 transitions, 125 flow [2020-10-16 04:47:43,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:47:43,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:47:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 532 transitions. [2020-10-16 04:47:43,094 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8822553897180763 [2020-10-16 04:47:43,094 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 532 transitions. [2020-10-16 04:47:43,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 532 transitions. [2020-10-16 04:47:43,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:43,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 532 transitions. [2020-10-16 04:47:43,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:47:43,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:47:43,097 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:47:43,098 INFO L185 Difference]: Start difference. First operand has 40 places, 33 transitions, 119 flow. Second operand 3 states and 532 transitions. [2020-10-16 04:47:43,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 33 transitions, 125 flow [2020-10-16 04:47:43,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 33 transitions, 120 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:47:43,101 INFO L241 Difference]: Finished difference. Result has 42 places, 33 transitions, 122 flow [2020-10-16 04:47:43,101 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2020-10-16 04:47:43,102 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2020-10-16 04:47:43,102 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 122 flow [2020-10-16 04:47:43,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:47:43,102 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:43,102 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:43,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:47:43,103 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:43,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:43,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1596142270, now seen corresponding path program 1 times [2020-10-16 04:47:43,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:43,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917708708] [2020-10-16 04:47:43,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:43,214 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:47:43,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917708708] [2020-10-16 04:47:43,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:43,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:47:43,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693523158] [2020-10-16 04:47:43,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:47:43,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:43,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:47:43,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:47:43,218 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 201 [2020-10-16 04:47:43,220 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 122 flow. Second operand 3 states. [2020-10-16 04:47:43,220 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:43,220 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 201 [2020-10-16 04:47:43,220 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:43,251 INFO L129 PetriNetUnfolder]: 30/125 cut-off events. [2020-10-16 04:47:43,251 INFO L130 PetriNetUnfolder]: For 103/130 co-relation queries the response was YES. [2020-10-16 04:47:43,252 INFO L80 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 125 events. 30/125 cut-off events. For 103/130 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 549 event pairs, 7 based on Foata normal form. 6/121 useless extension candidates. Maximal degree in co-relation 259. Up to 41 conditions per place. [2020-10-16 04:47:43,253 INFO L132 encePairwiseOnDemand]: 197/201 looper letters, 3 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2020-10-16 04:47:43,254 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 35 transitions, 146 flow [2020-10-16 04:47:43,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:47:43,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:47:43,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2020-10-16 04:47:43,257 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8772802653399668 [2020-10-16 04:47:43,257 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 529 transitions. [2020-10-16 04:47:43,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 529 transitions. [2020-10-16 04:47:43,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:43,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 529 transitions. [2020-10-16 04:47:43,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:47:43,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:47:43,260 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:47:43,260 INFO L185 Difference]: Start difference. First operand has 42 places, 33 transitions, 122 flow. Second operand 3 states and 529 transitions. [2020-10-16 04:47:43,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 35 transitions, 146 flow [2020-10-16 04:47:43,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 35 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:47:43,263 INFO L241 Difference]: Finished difference. Result has 43 places, 35 transitions, 147 flow [2020-10-16 04:47:43,263 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2020-10-16 04:47:43,264 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2020-10-16 04:47:43,264 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 147 flow [2020-10-16 04:47:43,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:47:43,264 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:43,264 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:43,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:47:43,265 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:43,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:43,265 INFO L82 PathProgramCache]: Analyzing trace with hash 637693385, now seen corresponding path program 1 times [2020-10-16 04:47:43,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:43,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46213779] [2020-10-16 04:47:43,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:43,326 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:47:43,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46213779] [2020-10-16 04:47:43,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:43,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:47:43,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096760307] [2020-10-16 04:47:43,328 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:47:43,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:43,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:47:43,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:47:43,330 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 201 [2020-10-16 04:47:43,331 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 147 flow. Second operand 3 states. [2020-10-16 04:47:43,331 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:43,331 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 201 [2020-10-16 04:47:43,332 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:43,417 INFO L129 PetriNetUnfolder]: 28/122 cut-off events. [2020-10-16 04:47:43,417 INFO L130 PetriNetUnfolder]: For 134/167 co-relation queries the response was YES. [2020-10-16 04:47:43,418 INFO L80 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 122 events. 28/122 cut-off events. For 134/167 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 528 event pairs, 7 based on Foata normal form. 6/118 useless extension candidates. Maximal degree in co-relation 273. Up to 40 conditions per place. [2020-10-16 04:47:43,419 INFO L132 encePairwiseOnDemand]: 197/201 looper letters, 3 selfloop transitions, 5 changer transitions 0/37 dead transitions. [2020-10-16 04:47:43,419 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 171 flow [2020-10-16 04:47:43,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:47:43,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:47:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2020-10-16 04:47:43,422 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8772802653399668 [2020-10-16 04:47:43,422 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 529 transitions. [2020-10-16 04:47:43,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 529 transitions. [2020-10-16 04:47:43,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:43,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 529 transitions. [2020-10-16 04:47:43,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:47:43,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:47:43,425 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:47:43,426 INFO L185 Difference]: Start difference. First operand has 43 places, 35 transitions, 147 flow. Second operand 3 states and 529 transitions. [2020-10-16 04:47:43,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 171 flow [2020-10-16 04:47:43,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 37 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:47:43,431 INFO L241 Difference]: Finished difference. Result has 45 places, 37 transitions, 171 flow [2020-10-16 04:47:43,431 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=171, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2020-10-16 04:47:43,431 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2020-10-16 04:47:43,432 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 171 flow [2020-10-16 04:47:43,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:47:43,432 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:43,432 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:43,432 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:47:43,432 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:43,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:43,433 INFO L82 PathProgramCache]: Analyzing trace with hash 343536233, now seen corresponding path program 1 times [2020-10-16 04:47:43,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:43,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280933479] [2020-10-16 04:47:43,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:43,492 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:47:43,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280933479] [2020-10-16 04:47:43,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:43,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:47:43,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115402802] [2020-10-16 04:47:43,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:47:43,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:43,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:47:43,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:47:43,496 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 201 [2020-10-16 04:47:43,497 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 171 flow. Second operand 3 states. [2020-10-16 04:47:43,497 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:43,497 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 201 [2020-10-16 04:47:43,498 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:43,532 INFO L129 PetriNetUnfolder]: 22/120 cut-off events. [2020-10-16 04:47:43,533 INFO L130 PetriNetUnfolder]: For 207/245 co-relation queries the response was YES. [2020-10-16 04:47:43,533 INFO L80 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 120 events. 22/120 cut-off events. For 207/245 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 598 event pairs, 7 based on Foata normal form. 11/123 useless extension candidates. Maximal degree in co-relation 282. Up to 38 conditions per place. [2020-10-16 04:47:43,535 INFO L132 encePairwiseOnDemand]: 198/201 looper letters, 4 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2020-10-16 04:47:43,535 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 37 transitions, 187 flow [2020-10-16 04:47:43,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:47:43,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:47:43,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2020-10-16 04:47:43,538 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8756218905472637 [2020-10-16 04:47:43,538 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 528 transitions. [2020-10-16 04:47:43,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 528 transitions. [2020-10-16 04:47:43,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:43,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 528 transitions. [2020-10-16 04:47:43,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:47:43,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:47:43,546 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:47:43,547 INFO L185 Difference]: Start difference. First operand has 45 places, 37 transitions, 171 flow. Second operand 3 states and 528 transitions. [2020-10-16 04:47:43,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 37 transitions, 187 flow [2020-10-16 04:47:43,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:47:43,554 INFO L241 Difference]: Finished difference. Result has 47 places, 37 transitions, 180 flow [2020-10-16 04:47:43,554 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2020-10-16 04:47:43,554 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2020-10-16 04:47:43,554 INFO L481 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 180 flow [2020-10-16 04:47:43,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:47:43,555 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:43,555 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:43,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:47:43,555 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:43,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:43,556 INFO L82 PathProgramCache]: Analyzing trace with hash -2098749250, now seen corresponding path program 1 times [2020-10-16 04:47:43,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:43,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483299776] [2020-10-16 04:47:43,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:43,660 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:47:43,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483299776] [2020-10-16 04:47:43,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:43,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:47:43,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403723675] [2020-10-16 04:47:43,662 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:47:43,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:43,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:47:43,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:47:43,664 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 201 [2020-10-16 04:47:43,664 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 180 flow. Second operand 4 states. [2020-10-16 04:47:43,664 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:43,665 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 201 [2020-10-16 04:47:43,665 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:43,800 INFO L129 PetriNetUnfolder]: 351/718 cut-off events. [2020-10-16 04:47:43,800 INFO L130 PetriNetUnfolder]: For 804/982 co-relation queries the response was YES. [2020-10-16 04:47:43,804 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1714 conditions, 718 events. 351/718 cut-off events. For 804/982 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 4662 event pairs, 45 based on Foata normal form. 64/684 useless extension candidates. Maximal degree in co-relation 1696. Up to 334 conditions per place. [2020-10-16 04:47:43,809 INFO L132 encePairwiseOnDemand]: 194/201 looper letters, 10 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2020-10-16 04:47:43,809 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 230 flow [2020-10-16 04:47:43,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:47:43,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:47:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 666 transitions. [2020-10-16 04:47:43,812 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8283582089552238 [2020-10-16 04:47:43,812 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 666 transitions. [2020-10-16 04:47:43,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 666 transitions. [2020-10-16 04:47:43,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:43,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 666 transitions. [2020-10-16 04:47:43,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:47:43,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:47:43,817 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:47:43,817 INFO L185 Difference]: Start difference. First operand has 47 places, 37 transitions, 180 flow. Second operand 4 states and 666 transitions. [2020-10-16 04:47:43,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 230 flow [2020-10-16 04:47:43,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 224 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 04:47:43,821 INFO L241 Difference]: Finished difference. Result has 51 places, 42 transitions, 220 flow [2020-10-16 04:47:43,821 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2020-10-16 04:47:43,821 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2020-10-16 04:47:43,821 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 220 flow [2020-10-16 04:47:43,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:47:43,822 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:43,822 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:47:43,822 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:47:43,822 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:43,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:43,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1086722671, now seen corresponding path program 1 times [2020-10-16 04:47:43,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:43,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812070601] [2020-10-16 04:47:43,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:43,868 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:47:43,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812070601] [2020-10-16 04:47:43,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:43,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:47:43,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860012072] [2020-10-16 04:47:43,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:47:43,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:43,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:47:43,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:47:43,871 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 201 [2020-10-16 04:47:43,872 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 220 flow. Second operand 3 states. [2020-10-16 04:47:43,872 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:43,872 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 201 [2020-10-16 04:47:43,872 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:43,998 INFO L129 PetriNetUnfolder]: 461/919 cut-off events. [2020-10-16 04:47:43,998 INFO L130 PetriNetUnfolder]: For 1400/1741 co-relation queries the response was YES. [2020-10-16 04:47:44,003 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2236 conditions, 919 events. 461/919 cut-off events. For 1400/1741 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 6123 event pairs, 216 based on Foata normal form. 36/807 useless extension candidates. Maximal degree in co-relation 2215. Up to 758 conditions per place. [2020-10-16 04:47:44,007 INFO L132 encePairwiseOnDemand]: 198/201 looper letters, 4 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2020-10-16 04:47:44,007 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 236 flow [2020-10-16 04:47:44,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:47:44,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:47:44,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2020-10-16 04:47:44,010 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8756218905472637 [2020-10-16 04:47:44,010 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 528 transitions. [2020-10-16 04:47:44,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 528 transitions. [2020-10-16 04:47:44,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:44,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 528 transitions. [2020-10-16 04:47:44,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:47:44,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:47:44,014 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:47:44,014 INFO L185 Difference]: Start difference. First operand has 51 places, 42 transitions, 220 flow. Second operand 3 states and 528 transitions. [2020-10-16 04:47:44,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 236 flow [2020-10-16 04:47:44,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 42 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:47:44,017 INFO L241 Difference]: Finished difference. Result has 53 places, 42 transitions, 232 flow [2020-10-16 04:47:44,017 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2020-10-16 04:47:44,018 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2020-10-16 04:47:44,018 INFO L481 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 232 flow [2020-10-16 04:47:44,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:47:44,018 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:44,018 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:47:44,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:47:44,018 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:44,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:44,019 INFO L82 PathProgramCache]: Analyzing trace with hash -666238497, now seen corresponding path program 1 times [2020-10-16 04:47:44,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:44,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780611162] [2020-10-16 04:47:44,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:44,094 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:47:44,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780611162] [2020-10-16 04:47:44,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:44,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:47:44,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023707882] [2020-10-16 04:47:44,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:47:44,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:44,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:47:44,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:47:44,098 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 201 [2020-10-16 04:47:44,099 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 232 flow. Second operand 5 states. [2020-10-16 04:47:44,099 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:44,099 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 201 [2020-10-16 04:47:44,099 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:44,346 INFO L129 PetriNetUnfolder]: 570/1124 cut-off events. [2020-10-16 04:47:44,346 INFO L130 PetriNetUnfolder]: For 1194/3173 co-relation queries the response was YES. [2020-10-16 04:47:44,354 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3564 conditions, 1124 events. 570/1124 cut-off events. For 1194/3173 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 7516 event pairs, 45 based on Foata normal form. 156/1135 useless extension candidates. Maximal degree in co-relation 3542. Up to 900 conditions per place. [2020-10-16 04:47:44,359 INFO L132 encePairwiseOnDemand]: 194/201 looper letters, 11 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2020-10-16 04:47:44,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 310 flow [2020-10-16 04:47:44,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:47:44,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:47:44,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 833 transitions. [2020-10-16 04:47:44,365 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8288557213930349 [2020-10-16 04:47:44,365 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 833 transitions. [2020-10-16 04:47:44,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 833 transitions. [2020-10-16 04:47:44,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:44,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 833 transitions. [2020-10-16 04:47:44,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:47:44,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:47:44,374 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:47:44,374 INFO L185 Difference]: Start difference. First operand has 53 places, 42 transitions, 232 flow. Second operand 5 states and 833 transitions. [2020-10-16 04:47:44,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 310 flow [2020-10-16 04:47:44,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 51 transitions, 304 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 04:47:44,379 INFO L241 Difference]: Finished difference. Result has 58 places, 47 transitions, 293 flow [2020-10-16 04:47:44,380 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=293, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2020-10-16 04:47:44,380 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2020-10-16 04:47:44,380 INFO L481 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 293 flow [2020-10-16 04:47:44,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:47:44,380 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:44,381 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] [2020-10-16 04:47:44,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:47:44,381 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:44,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:44,381 INFO L82 PathProgramCache]: Analyzing trace with hash -182069891, now seen corresponding path program 1 times [2020-10-16 04:47:44,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:44,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586843212] [2020-10-16 04:47:44,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:44,484 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:47:44,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586843212] [2020-10-16 04:47:44,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:44,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:47:44,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445081474] [2020-10-16 04:47:44,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:47:44,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:44,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:47:44,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:47:44,489 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 201 [2020-10-16 04:47:44,490 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 293 flow. Second operand 6 states. [2020-10-16 04:47:44,490 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:44,490 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 201 [2020-10-16 04:47:44,490 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:44,759 INFO L129 PetriNetUnfolder]: 479/988 cut-off events. [2020-10-16 04:47:44,760 INFO L130 PetriNetUnfolder]: For 2387/5917 co-relation queries the response was YES. [2020-10-16 04:47:44,765 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4275 conditions, 988 events. 479/988 cut-off events. For 2387/5917 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 6560 event pairs, 29 based on Foata normal form. 179/1025 useless extension candidates. Maximal degree in co-relation 4250. Up to 785 conditions per place. [2020-10-16 04:47:44,771 INFO L132 encePairwiseOnDemand]: 194/201 looper letters, 12 selfloop transitions, 14 changer transitions 0/56 dead transitions. [2020-10-16 04:47:44,772 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 56 transitions, 400 flow [2020-10-16 04:47:44,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:47:44,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:47:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1000 transitions. [2020-10-16 04:47:44,776 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8291873963515755 [2020-10-16 04:47:44,776 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1000 transitions. [2020-10-16 04:47:44,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1000 transitions. [2020-10-16 04:47:44,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:44,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1000 transitions. [2020-10-16 04:47:44,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:47:44,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:47:44,785 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:47:44,785 INFO L185 Difference]: Start difference. First operand has 58 places, 47 transitions, 293 flow. Second operand 6 states and 1000 transitions. [2020-10-16 04:47:44,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 56 transitions, 400 flow [2020-10-16 04:47:44,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 56 transitions, 384 flow, removed 4 selfloop flow, removed 2 redundant places. [2020-10-16 04:47:44,790 INFO L241 Difference]: Finished difference. Result has 63 places, 52 transitions, 363 flow [2020-10-16 04:47:44,791 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=363, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2020-10-16 04:47:44,792 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2020-10-16 04:47:44,792 INFO L481 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 363 flow [2020-10-16 04:47:44,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:47:44,792 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:44,792 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, 1, 1] [2020-10-16 04:47:44,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:47:44,793 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:44,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:44,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1604636033, now seen corresponding path program 1 times [2020-10-16 04:47:44,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:44,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483723187] [2020-10-16 04:47:44,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:44,945 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:47:44,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483723187] [2020-10-16 04:47:44,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:44,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:47:44,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459182721] [2020-10-16 04:47:44,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:47:44,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:44,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:47:44,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:47:44,951 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 201 [2020-10-16 04:47:44,952 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 363 flow. Second operand 7 states. [2020-10-16 04:47:44,952 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:44,952 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 201 [2020-10-16 04:47:44,952 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:45,234 INFO L129 PetriNetUnfolder]: 453/932 cut-off events. [2020-10-16 04:47:45,234 INFO L130 PetriNetUnfolder]: For 4294/7639 co-relation queries the response was YES. [2020-10-16 04:47:45,240 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4803 conditions, 932 events. 453/932 cut-off events. For 4294/7639 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 6188 event pairs, 27 based on Foata normal form. 162/952 useless extension candidates. Maximal degree in co-relation 4776. Up to 685 conditions per place. [2020-10-16 04:47:45,244 INFO L132 encePairwiseOnDemand]: 194/201 looper letters, 5 selfloop transitions, 18 changer transitions 6/53 dead transitions. [2020-10-16 04:47:45,244 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 53 transitions, 418 flow [2020-10-16 04:47:45,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:47:45,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:47:45,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1159 transitions. [2020-10-16 04:47:45,249 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8237384506041222 [2020-10-16 04:47:45,249 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1159 transitions. [2020-10-16 04:47:45,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1159 transitions. [2020-10-16 04:47:45,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:45,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1159 transitions. [2020-10-16 04:47:45,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:47:45,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:47:45,255 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:47:45,255 INFO L185 Difference]: Start difference. First operand has 63 places, 52 transitions, 363 flow. Second operand 7 states and 1159 transitions. [2020-10-16 04:47:45,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 53 transitions, 418 flow [2020-10-16 04:47:45,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 53 transitions, 374 flow, removed 13 selfloop flow, removed 4 redundant places. [2020-10-16 04:47:45,276 INFO L241 Difference]: Finished difference. Result has 67 places, 47 transitions, 343 flow [2020-10-16 04:47:45,277 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=343, PETRI_PLACES=67, PETRI_TRANSITIONS=47} [2020-10-16 04:47:45,277 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2020-10-16 04:47:45,277 INFO L481 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 343 flow [2020-10-16 04:47:45,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:47:45,277 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:45,278 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, 1, 1, 1, 1, 1] [2020-10-16 04:47:45,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 04:47:45,278 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:45,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:45,278 INFO L82 PathProgramCache]: Analyzing trace with hash 108095001, now seen corresponding path program 1 times [2020-10-16 04:47:45,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:45,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588432617] [2020-10-16 04:47:45,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:45,343 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:47:45,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588432617] [2020-10-16 04:47:45,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:45,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:47:45,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410287134] [2020-10-16 04:47:45,345 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:47:45,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:45,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:47:45,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:47:45,348 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 201 [2020-10-16 04:47:45,349 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 47 transitions, 343 flow. Second operand 4 states. [2020-10-16 04:47:45,349 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:45,349 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 201 [2020-10-16 04:47:45,349 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:45,421 INFO L129 PetriNetUnfolder]: 182/418 cut-off events. [2020-10-16 04:47:45,422 INFO L130 PetriNetUnfolder]: For 1950/2222 co-relation queries the response was YES. [2020-10-16 04:47:45,426 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1840 conditions, 418 events. 182/418 cut-off events. For 1950/2222 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 2459 event pairs, 2 based on Foata normal form. 1/360 useless extension candidates. Maximal degree in co-relation 1812. Up to 175 conditions per place. [2020-10-16 04:47:45,427 INFO L132 encePairwiseOnDemand]: 198/201 looper letters, 3 selfloop transitions, 1 changer transitions 9/48 dead transitions. [2020-10-16 04:47:45,427 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 48 transitions, 355 flow [2020-10-16 04:47:45,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:47:45,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:47:45,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 686 transitions. [2020-10-16 04:47:45,431 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8532338308457711 [2020-10-16 04:47:45,431 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 686 transitions. [2020-10-16 04:47:45,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 686 transitions. [2020-10-16 04:47:45,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:45,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 686 transitions. [2020-10-16 04:47:45,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:47:45,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:47:45,435 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:47:45,436 INFO L185 Difference]: Start difference. First operand has 67 places, 47 transitions, 343 flow. Second operand 4 states and 686 transitions. [2020-10-16 04:47:45,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 48 transitions, 355 flow [2020-10-16 04:47:45,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 48 transitions, 288 flow, removed 14 selfloop flow, removed 9 redundant places. [2020-10-16 04:47:45,449 INFO L241 Difference]: Finished difference. Result has 63 places, 39 transitions, 232 flow [2020-10-16 04:47:45,449 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=232, PETRI_PLACES=63, PETRI_TRANSITIONS=39} [2020-10-16 04:47:45,449 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2020-10-16 04:47:45,450 INFO L481 AbstractCegarLoop]: Abstraction has has 63 places, 39 transitions, 232 flow [2020-10-16 04:47:45,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:47:45,450 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:45,450 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, 1, 1, 1, 1, 1] [2020-10-16 04:47:45,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 04:47:45,450 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:45,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:45,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1047788061, now seen corresponding path program 2 times [2020-10-16 04:47:45,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:45,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068627989] [2020-10-16 04:47:45,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:47:45,515 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:47:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:47:45,567 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:47:45,606 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:47:45,607 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:47:45,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 04:47:45,608 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 04:47:45,625 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1295] [1295] L851-->L859: Formula: (let ((.cse6 (= (mod ~z$w_buff1_used~0_In-1573074593 256) 0)) (.cse7 (= (mod ~z$r_buff1_thd0~0_In-1573074593 256) 0)) (.cse9 (= (mod ~z$r_buff0_thd0~0_In-1573074593 256) 0)) (.cse8 (= 0 (mod ~z$w_buff0_used~0_In-1573074593 256)))) (let ((.cse5 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (not .cse7)) (.cse3 (not .cse6)) (.cse4 (or .cse6 .cse7))) (and (= ~z$r_buff0_thd0~0_Out-1573074593 ~z$r_buff0_thd0~0_In-1573074593) (= (mod ~main$tmp_guard0~0_In-1573074593 256) |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1573074593|) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1573074593 |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1573074593|) (or (and .cse0 .cse1 (= ~z$w_buff0~0_In-1573074593 ~z~0_Out-1573074593)) (and (or (and (= ~z$w_buff1~0_In-1573074593 ~z~0_Out-1573074593) .cse2 .cse3) (and (= ~z~0_In-1573074593 ~z~0_Out-1573074593) .cse4)) .cse5)) (or (and .cse5 (= ~z$w_buff0_used~0_In-1573074593 ~z$w_buff0_used~0_Out-1573074593)) (and (= ~z$w_buff0_used~0_Out-1573074593 0) .cse0 .cse1)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1573074593 0)) (= ~z$r_buff1_thd0~0_In-1573074593 ~z$r_buff1_thd0~0_Out-1573074593) (or (and (= ~z$w_buff1_used~0_Out-1573074593 0) .cse2 .cse3) (and (= ~z$w_buff1_used~0_Out-1573074593 ~z$w_buff1_used~0_In-1573074593) .cse4))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1573074593, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1573074593, ~z$w_buff0~0=~z$w_buff0~0_In-1573074593, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1573074593, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1573074593, ~z$w_buff1~0=~z$w_buff1~0_In-1573074593, ~z~0=~z~0_In-1573074593, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-1573074593} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1573074593, ~z$w_buff0~0=~z$w_buff0~0_In-1573074593, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1573074593, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1573074593|, ~z$w_buff1~0=~z$w_buff1~0_In-1573074593, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-1573074593, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1573074593|, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1573074593|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1573074593|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1573074593|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1573074593|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-1573074593, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1573074593|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1573074593, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1573074593, ~z~0=~z~0_Out-1573074593} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_assume_abort_if_not_#in~cond, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_assume_abort_if_not_~cond, ~z$r_buff1_thd0~0, ~z~0] because there is no mapped edge [2020-10-16 04:47:45,632 WARN 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:47:45,632 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,633 WARN 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:47:45,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,633 WARN 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:47:45,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,634 WARN 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:47:45,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,634 WARN 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:47:45,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,634 WARN 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:47:45,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,635 WARN 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:47:45,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,635 WARN 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:47:45,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,636 WARN 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:47:45,636 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,636 WARN 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:47:45,636 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,636 WARN 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:47:45,636 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,637 WARN 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:47:45,637 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,639 WARN 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:47:45,639 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,639 WARN 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:47:45,639 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,639 WARN 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:47:45,639 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,640 WARN 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:47:45,640 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,640 WARN 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:47:45,640 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,641 WARN 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:47:45,641 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,641 WARN 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:47:45,641 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,641 WARN 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:47:45,642 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,642 WARN 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:47:45,642 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,642 WARN 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:47:45,642 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,643 WARN 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:47:45,643 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,643 WARN 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:47:45,643 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,643 WARN 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:47:45,644 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,644 WARN 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:47:45,644 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,644 WARN 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:47:45,645 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,645 WARN 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:47:45,645 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,645 WARN 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:47:45,645 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,645 WARN 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:47:45,645 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,646 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:45,646 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,646 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:45,646 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:45,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:47:45 BasicIcfg [2020-10-16 04:47:45,719 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:47:45,721 INFO L168 Benchmark]: Toolchain (without parser) took 18650.23 ms. Allocated memory was 250.1 MB in the beginning and 626.5 MB in the end (delta: 376.4 MB). Free memory was 204.8 MB in the beginning and 356.0 MB in the end (delta: -151.2 MB). Peak memory consumption was 225.3 MB. Max. memory is 14.2 GB. [2020-10-16 04:47:45,724 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 250.1 MB. Free memory was 228.1 MB in the beginning and 227.3 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB. [2020-10-16 04:47:45,725 INFO L168 Benchmark]: CACSL2BoogieTranslator took 795.61 ms. Allocated memory was 250.1 MB in the beginning and 310.4 MB in the end (delta: 60.3 MB). Free memory was 204.8 MB in the beginning and 259.3 MB in the end (delta: -54.5 MB). Peak memory consumption was 28.1 MB. Max. memory is 14.2 GB. [2020-10-16 04:47:45,725 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.14 ms. Allocated memory is still 310.4 MB. Free memory was 258.4 MB in the beginning and 255.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-16 04:47:45,728 INFO L168 Benchmark]: Boogie Preprocessor took 43.68 ms. Allocated memory is still 310.4 MB. Free memory was 255.1 MB in the beginning and 252.5 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:47:45,731 INFO L168 Benchmark]: RCFGBuilder took 2674.27 ms. Allocated memory was 310.4 MB in the beginning and 370.1 MB in the end (delta: 59.8 MB). Free memory was 252.5 MB in the beginning and 288.4 MB in the end (delta: -35.9 MB). Peak memory consumption was 145.7 MB. Max. memory is 14.2 GB. [2020-10-16 04:47:45,734 INFO L168 Benchmark]: TraceAbstraction took 15054.66 ms. Allocated memory was 370.1 MB in the beginning and 626.5 MB in the end (delta: 256.4 MB). Free memory was 288.4 MB in the beginning and 356.0 MB in the end (delta: -67.5 MB). Peak memory consumption was 188.9 MB. Max. memory is 14.2 GB. [2020-10-16 04:47:45,747 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.23 ms. Allocated memory is still 250.1 MB. Free memory was 228.1 MB in the beginning and 227.3 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 795.61 ms. Allocated memory was 250.1 MB in the beginning and 310.4 MB in the end (delta: 60.3 MB). Free memory was 204.8 MB in the beginning and 259.3 MB in the end (delta: -54.5 MB). Peak memory consumption was 28.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 77.14 ms. Allocated memory is still 310.4 MB. Free memory was 258.4 MB in the beginning and 255.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 43.68 ms. Allocated memory is still 310.4 MB. Free memory was 255.1 MB in the beginning and 252.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2674.27 ms. Allocated memory was 310.4 MB in the beginning and 370.1 MB in the end (delta: 59.8 MB). Free memory was 252.5 MB in the beginning and 288.4 MB in the end (delta: -35.9 MB). Peak memory consumption was 145.7 MB. Max. memory is 14.2 GB. * TraceAbstraction took 15054.66 ms. Allocated memory was 370.1 MB in the beginning and 626.5 MB in the end (delta: 256.4 MB). Free memory was 288.4 MB in the beginning and 356.0 MB in the end (delta: -67.5 MB). Peak memory consumption was 188.9 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1643 VarBasedMoverChecksPositive, 100 VarBasedMoverChecksNegative, 34 SemBasedMoverChecksPositive, 66 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 233 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.9s, 116 PlacesBefore, 41 PlacesAfterwards, 105 TransitionsBefore, 29 TransitionsAfterwards, 2446 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 6967 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p3_EAX = 0; [L703] 0 int __unbuffered_p3_EBX = 0; [L705] 0 int a = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L711] 0 int y = 0; [L713] 0 int z = 0; [L714] 0 _Bool z$flush_delayed; [L715] 0 int z$mem_tmp; [L716] 0 _Bool z$r_buff0_thd0; [L717] 0 _Bool z$r_buff0_thd1; [L718] 0 _Bool z$r_buff0_thd2; [L719] 0 _Bool z$r_buff0_thd3; [L720] 0 _Bool z$r_buff0_thd4; [L721] 0 _Bool z$r_buff1_thd0; [L722] 0 _Bool z$r_buff1_thd1; [L723] 0 _Bool z$r_buff1_thd2; [L724] 0 _Bool z$r_buff1_thd3; [L725] 0 _Bool z$r_buff1_thd4; [L726] 0 _Bool z$read_delayed; [L727] 0 int *z$read_delayed_var; [L728] 0 int z$w_buff0; [L729] 0 _Bool z$w_buff0_used; [L730] 0 int z$w_buff1; [L731] 0 _Bool z$w_buff1_used; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L841] 0 pthread_t t825; [L842] FCALL, FORK 0 pthread_create(&t825, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L843] 0 pthread_t t826; [L844] FCALL, FORK 0 pthread_create(&t826, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L845] 0 pthread_t t827; [L846] FCALL, FORK 0 pthread_create(&t827, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L847] 0 pthread_t t828; [L848] FCALL, FORK 0 pthread_create(&t828, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L787] 4 z$w_buff1 = z$w_buff0 [L788] 4 z$w_buff0 = 2 [L789] 4 z$w_buff1_used = z$w_buff0_used [L790] 4 z$w_buff0_used = (_Bool)1 [L7] COND FALSE 4 !(!expression) [L792] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L793] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L794] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L795] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L796] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L797] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 4 z$flush_delayed = weak$$choice2 [L803] 4 z$mem_tmp = z [L804] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L804] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L805] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L805] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L806] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L806] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L807] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L807] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used) [L807] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L807] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used) [L807] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L807] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L808] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L808] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L809] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L810] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L810] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L810] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L810] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L811] 4 __unbuffered_p3_EAX = z [L812] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L812] 4 z = z$flush_delayed ? z$mem_tmp : z [L813] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L737] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=2, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 1 return 0; [L760] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 2 return 0; [L767] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=2, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=2, y=2, z=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 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) [L773] 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) [L774] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L775] 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 [L776] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L776] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L777] 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 [L780] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 3 return 0; [L819] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L819] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L820] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L821] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L821] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L823] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 4 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=2, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 z$flush_delayed = weak$$choice2 [L864] 0 z$mem_tmp = z [L865] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L865] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L865] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L865] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L866] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L866] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L867] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L867] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L868] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L868] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L869] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L870] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L871] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L871] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L873] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L873] 0 z = z$flush_delayed ? z$mem_tmp : z [L874] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 108 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: 14.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.0s, HoareTripleCheckerStatistics: 55 SDtfs, 15 SDslu, 23 SDs, 0 SdLazy, 141 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=363occurred in iteration=11, 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.5s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 10012 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...