/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix017_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:18:08,570 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:18:08,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:18:08,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:18:08,614 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:18:08,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:18:08,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:18:08,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:18:08,631 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:18:08,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:18:08,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:18:08,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:18:08,637 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:18:08,640 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:18:08,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:18:08,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:18:08,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:18:08,647 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:18:08,648 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:18:08,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:18:08,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:18:08,660 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:18:08,661 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:18:08,662 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:18:08,677 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:18:08,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:18:08,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:18:08,679 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:18:08,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:18:08,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:18:08,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:18:08,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:18:08,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:18:08,690 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:18:08,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:18:08,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:18:08,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:18:08,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:18:08,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:18:08,693 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:18:08,695 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:18:08,698 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.epf [2020-10-16 01:18:08,740 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:18:08,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:18:08,743 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:18:08,743 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:18:08,743 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:18:08,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:18:08,744 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:18:08,744 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:18:08,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:18:08,744 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:18:08,746 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:18:08,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:18:08,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:18:08,747 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:18:08,747 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:18:08,747 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:18:08,747 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:18:08,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:18:08,748 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:18:08,748 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:18:08,748 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:18:08,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:18:08,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:18:08,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:18:08,749 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:18:08,749 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:18:08,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:18:08,750 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:18:08,750 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:18:09,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:18:09,086 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:18:09,091 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:18:09,092 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:18:09,093 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:18:09,094 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_pso.oepc.i [2020-10-16 01:18:09,147 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce5b84aef/810c9364a3f748c6bd5da10f26915662/FLAG91430fc1f [2020-10-16 01:18:09,763 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:18:09,764 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_pso.oepc.i [2020-10-16 01:18:09,779 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce5b84aef/810c9364a3f748c6bd5da10f26915662/FLAG91430fc1f [2020-10-16 01:18:09,993 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce5b84aef/810c9364a3f748c6bd5da10f26915662 [2020-10-16 01:18:10,001 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:18:10,003 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:18:10,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:18:10,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:18:10,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:18:10,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:18:09" (1/1) ... [2020-10-16 01:18:10,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77674f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:10, skipping insertion in model container [2020-10-16 01:18:10,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:18:09" (1/1) ... [2020-10-16 01:18:10,021 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:18:10,094 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:18:10,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:18:10,640 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:18:10,722 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:18:10,799 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:18:10,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:10 WrapperNode [2020-10-16 01:18:10,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:18:10,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:18:10,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:18:10,801 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:18:10,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:10" (1/1) ... [2020-10-16 01:18:10,831 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:10" (1/1) ... [2020-10-16 01:18:10,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:18:10,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:18:10,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:18:10,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:18:10,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:10" (1/1) ... [2020-10-16 01:18:10,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:10" (1/1) ... [2020-10-16 01:18:10,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:10" (1/1) ... [2020-10-16 01:18:10,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:10" (1/1) ... [2020-10-16 01:18:10,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:10" (1/1) ... [2020-10-16 01:18:10,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:10" (1/1) ... [2020-10-16 01:18:10,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:10" (1/1) ... [2020-10-16 01:18:10,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:18:10,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:18:10,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:18:10,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:18:10,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:10" (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 01:18:10,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:18:10,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:18:10,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:18:10,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:18:10,991 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:18:10,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:18:10,993 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:18:10,993 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:18:10,994 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:18:10,994 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:18:10,997 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 01:18:10,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 01:18:10,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:18:10,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:18:10,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:18:11,000 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 01:18:13,183 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:18:13,183 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:18:13,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:18:13 BoogieIcfgContainer [2020-10-16 01:18:13,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:18:13,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:18:13,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:18:13,191 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:18:13,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:18:09" (1/3) ... [2020-10-16 01:18:13,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675ffe33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:18:13, skipping insertion in model container [2020-10-16 01:18:13,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:10" (2/3) ... [2020-10-16 01:18:13,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675ffe33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:18:13, skipping insertion in model container [2020-10-16 01:18:13,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:18:13" (3/3) ... [2020-10-16 01:18:13,194 INFO L111 eAbstractionObserver]: Analyzing ICFG mix017_pso.oepc.i [2020-10-16 01:18:13,206 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:18:13,214 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:18:13,215 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:18:13,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,251 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,251 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,252 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,252 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,255 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,256 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,258 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,259 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,261 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,261 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,261 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,262 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,264 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,264 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,264 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,264 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,264 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,264 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,265 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,265 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,265 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,265 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,265 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,270 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,270 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,270 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,270 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,270 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,271 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,271 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,271 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,271 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,275 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,275 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,280 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,280 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,280 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,280 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,281 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,282 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,286 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,286 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,287 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,287 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,287 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,287 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,287 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,288 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,288 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,288 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,288 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,288 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,289 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,289 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,289 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,289 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,289 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,290 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,290 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,290 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,290 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,290 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,291 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,291 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,291 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,291 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,291 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,292 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,292 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,292 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,292 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,292 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,295 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,296 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,296 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,296 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,296 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,296 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:18:13,314 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 01:18:13,335 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:18:13,335 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:18:13,335 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:18:13,335 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:18:13,335 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:18:13,335 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:18:13,336 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:18:13,336 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:18:13,351 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 125 places, 114 transitions, 248 flow [2020-10-16 01:18:13,403 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2020-10-16 01:18:13,403 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:18:13,409 INFO L80 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 87 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2020-10-16 01:18:13,409 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 114 transitions, 248 flow [2020-10-16 01:18:13,416 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 110 transitions, 232 flow [2020-10-16 01:18:13,420 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:18:13,423 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 110 transitions, 232 flow [2020-10-16 01:18:13,427 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 110 transitions, 232 flow [2020-10-16 01:18:13,428 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 121 places, 110 transitions, 232 flow [2020-10-16 01:18:13,456 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2020-10-16 01:18:13,456 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:18:13,457 INFO L80 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 83 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2020-10-16 01:18:13,462 INFO L117 LiptonReduction]: Number of co-enabled transitions 2714 [2020-10-16 01:18:13,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:13,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:13,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:13,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:13,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:13,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:13,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:13,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:13,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:13,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:13,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:13,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:13,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:13,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:13,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:13,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:13,882 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-10-16 01:18:13,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:13,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:13,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:13,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:13,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:13,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:13,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:13,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:14,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:14,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:14,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:14,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:14,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:14,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:14,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:14,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:14,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:14,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:14,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:14,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:14,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:14,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:14,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:14,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:14,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:14,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:14,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:14,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:14,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:14,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:14,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:14,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:14,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:14,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:14,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:14,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:14,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:14,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:14,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:14,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:14,593 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:14,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:14,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:14,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:14,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:14,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:14,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:14,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:14,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:14,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:14,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:14,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:14,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:14,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:14,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:14,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:14,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:14,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:14,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:14,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:14,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:14,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:14,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:14,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:14,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:14,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:14,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:14,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:14,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:14,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:15,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:18:15,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:15,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:18:15,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:15,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:15,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:15,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:18:15,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:18:15,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:18:15,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:18:15,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:18:15,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:18:15,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:18:15,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:18:15,307 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 01:18:15,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:18:15,309 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 01:18:15,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:18:15,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:18:15,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:18:15,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:18:15,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:18:15,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:15,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:15,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:15,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:15,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:15,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:15,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:15,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:15,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:15,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:15,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:15,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:15,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:18:15,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:15,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:15,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:18:15,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:18:15,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:18:15,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:18:15,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:18:15,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:18:15,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:15,669 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:18:15,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:18:15,671 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:18:15,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:18:15,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:18:15,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:18:15,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:18:15,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:18:15,709 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 01:18:15,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:18:15,715 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 01:18:15,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:18:16,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:18:16,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:18:16,911 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2020-10-16 01:18:17,075 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-16 01:18:17,097 INFO L132 LiptonReduction]: Checked pairs total: 7888 [2020-10-16 01:18:17,097 INFO L134 LiptonReduction]: Total number of compositions: 91 [2020-10-16 01:18:17,110 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3694 [2020-10-16 01:18:17,127 INFO L129 PetriNetUnfolder]: 0/4 cut-off events. [2020-10-16 01:18:17,128 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:18:17,128 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:18:17,129 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2020-10-16 01:18:17,129 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:18:17,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:18:17,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1199647, now seen corresponding path program 1 times [2020-10-16 01:18:17,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:18:17,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011819938] [2020-10-16 01:18:17,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:18:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:18:17,371 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 01:18:17,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011819938] [2020-10-16 01:18:17,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:18:17,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:18:17,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385283030] [2020-10-16 01:18:17,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:18:17,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:18:17,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:18:17,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:18:17,404 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 205 [2020-10-16 01:18:17,406 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states. [2020-10-16 01:18:17,407 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:18:17,407 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 205 [2020-10-16 01:18:17,408 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:18:17,548 INFO L129 PetriNetUnfolder]: 133/316 cut-off events. [2020-10-16 01:18:17,549 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:18:17,551 INFO L80 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 316 events. 133/316 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1668 event pairs, 110 based on Foata normal form. 33/322 useless extension candidates. Maximal degree in co-relation 524. Up to 153 conditions per place. [2020-10-16 01:18:17,554 INFO L132 encePairwiseOnDemand]: 201/205 looper letters, 11 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2020-10-16 01:18:17,555 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 108 flow [2020-10-16 01:18:17,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:18:17,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:18:17,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 550 transitions. [2020-10-16 01:18:17,582 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8943089430894309 [2020-10-16 01:18:17,583 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 550 transitions. [2020-10-16 01:18:17,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 550 transitions. [2020-10-16 01:18:17,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:18:17,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 550 transitions. [2020-10-16 01:18:17,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:18:17,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:18:17,608 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:18:17,610 INFO L185 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 550 transitions. [2020-10-16 01:18:17,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 108 flow [2020-10-16 01:18:17,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 35 transitions, 104 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 01:18:17,619 INFO L241 Difference]: Finished difference. Result has 41 places, 30 transitions, 72 flow [2020-10-16 01:18:17,622 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2020-10-16 01:18:17,623 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2020-10-16 01:18:17,623 INFO L481 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 72 flow [2020-10-16 01:18:17,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:18:17,623 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:18:17,623 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:18:17,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:18:17,624 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:18:17,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:18:17,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1366977952, now seen corresponding path program 1 times [2020-10-16 01:18:17,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:18:17,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819739666] [2020-10-16 01:18:17,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:18:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:18:17,715 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 01:18:17,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819739666] [2020-10-16 01:18:17,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:18:17,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:18:17,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155444226] [2020-10-16 01:18:17,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:18:17,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:18:17,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:18:17,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:18:17,720 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 205 [2020-10-16 01:18:17,721 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 72 flow. Second operand 3 states. [2020-10-16 01:18:17,721 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:18:17,721 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 205 [2020-10-16 01:18:17,721 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:18:17,757 INFO L129 PetriNetUnfolder]: 45/136 cut-off events. [2020-10-16 01:18:17,758 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:18:17,758 INFO L80 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 136 events. 45/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 597 event pairs, 23 based on Foata normal form. 1/122 useless extension candidates. Maximal degree in co-relation 216. Up to 76 conditions per place. [2020-10-16 01:18:17,760 INFO L132 encePairwiseOnDemand]: 199/205 looper letters, 5 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2020-10-16 01:18:17,760 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 34 transitions, 100 flow [2020-10-16 01:18:17,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:18:17,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:18:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2020-10-16 01:18:17,762 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8569105691056911 [2020-10-16 01:18:17,762 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 527 transitions. [2020-10-16 01:18:17,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 527 transitions. [2020-10-16 01:18:17,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:18:17,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 527 transitions. [2020-10-16 01:18:17,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:18:17,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:18:17,766 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:18:17,766 INFO L185 Difference]: Start difference. First operand has 41 places, 30 transitions, 72 flow. Second operand 3 states and 527 transitions. [2020-10-16 01:18:17,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 34 transitions, 100 flow [2020-10-16 01:18:17,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 34 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:18:17,768 INFO L241 Difference]: Finished difference. Result has 42 places, 34 transitions, 101 flow [2020-10-16 01:18:17,768 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2020-10-16 01:18:17,769 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2020-10-16 01:18:17,769 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 101 flow [2020-10-16 01:18:17,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:18:17,769 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:18:17,769 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:18:17,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:18:17,770 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:18:17,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:18:17,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1167418221, now seen corresponding path program 1 times [2020-10-16 01:18:17,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:18:17,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105863691] [2020-10-16 01:18:17,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:18:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:18:17,853 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 01:18:17,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105863691] [2020-10-16 01:18:17,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:18:17,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:18:17,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033212162] [2020-10-16 01:18:17,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:18:17,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:18:17,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:18:17,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:18:17,857 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 205 [2020-10-16 01:18:17,858 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 101 flow. Second operand 4 states. [2020-10-16 01:18:17,858 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:18:17,858 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 205 [2020-10-16 01:18:17,858 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:18:17,903 INFO L129 PetriNetUnfolder]: 33/120 cut-off events. [2020-10-16 01:18:17,903 INFO L130 PetriNetUnfolder]: For 13/45 co-relation queries the response was YES. [2020-10-16 01:18:17,904 INFO L80 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 120 events. 33/120 cut-off events. For 13/45 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 447 event pairs, 7 based on Foata normal form. 11/118 useless extension candidates. Maximal degree in co-relation 246. Up to 60 conditions per place. [2020-10-16 01:18:17,905 INFO L132 encePairwiseOnDemand]: 199/205 looper letters, 5 selfloop transitions, 9 changer transitions 0/38 dead transitions. [2020-10-16 01:18:17,905 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 38 transitions, 145 flow [2020-10-16 01:18:17,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:18:17,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:18:17,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 703 transitions. [2020-10-16 01:18:17,908 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8573170731707317 [2020-10-16 01:18:17,908 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 703 transitions. [2020-10-16 01:18:17,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 703 transitions. [2020-10-16 01:18:17,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:18:17,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 703 transitions. [2020-10-16 01:18:17,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:18:17,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:18:17,912 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:18:17,912 INFO L185 Difference]: Start difference. First operand has 42 places, 34 transitions, 101 flow. Second operand 4 states and 703 transitions. [2020-10-16 01:18:17,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 38 transitions, 145 flow [2020-10-16 01:18:17,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 140 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:18:17,914 INFO L241 Difference]: Finished difference. Result has 45 places, 38 transitions, 148 flow [2020-10-16 01:18:17,915 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2020-10-16 01:18:17,915 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2020-10-16 01:18:17,915 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 148 flow [2020-10-16 01:18:17,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:18:17,915 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:18:17,916 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 01:18:17,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:18:17,916 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:18:17,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:18:17,916 INFO L82 PathProgramCache]: Analyzing trace with hash -518127945, now seen corresponding path program 1 times [2020-10-16 01:18:17,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:18:17,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482953685] [2020-10-16 01:18:17,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:18:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:18:18,024 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 01:18:18,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482953685] [2020-10-16 01:18:18,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:18:18,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:18:18,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534729428] [2020-10-16 01:18:18,029 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:18:18,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:18:18,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:18:18,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:18:18,031 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 205 [2020-10-16 01:18:18,032 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 148 flow. Second operand 5 states. [2020-10-16 01:18:18,032 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:18:18,032 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 205 [2020-10-16 01:18:18,033 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:18:18,084 INFO L129 PetriNetUnfolder]: 21/82 cut-off events. [2020-10-16 01:18:18,084 INFO L130 PetriNetUnfolder]: For 50/115 co-relation queries the response was YES. [2020-10-16 01:18:18,085 INFO L80 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 82 events. 21/82 cut-off events. For 50/115 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 208 event pairs, 1 based on Foata normal form. 22/96 useless extension candidates. Maximal degree in co-relation 221. Up to 42 conditions per place. [2020-10-16 01:18:18,086 INFO L132 encePairwiseOnDemand]: 199/205 looper letters, 5 selfloop transitions, 13 changer transitions 0/42 dead transitions. [2020-10-16 01:18:18,086 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 208 flow [2020-10-16 01:18:18,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:18:18,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:18:18,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 879 transitions. [2020-10-16 01:18:18,089 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8575609756097561 [2020-10-16 01:18:18,090 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 879 transitions. [2020-10-16 01:18:18,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 879 transitions. [2020-10-16 01:18:18,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:18:18,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 879 transitions. [2020-10-16 01:18:18,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:18:18,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:18:18,094 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:18:18,094 INFO L185 Difference]: Start difference. First operand has 45 places, 38 transitions, 148 flow. Second operand 5 states and 879 transitions. [2020-10-16 01:18:18,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 208 flow [2020-10-16 01:18:18,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 190 flow, removed 4 selfloop flow, removed 2 redundant places. [2020-10-16 01:18:18,097 INFO L241 Difference]: Finished difference. Result has 48 places, 42 transitions, 198 flow [2020-10-16 01:18:18,097 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=48, PETRI_TRANSITIONS=42} [2020-10-16 01:18:18,098 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2020-10-16 01:18:18,098 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 198 flow [2020-10-16 01:18:18,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:18:18,098 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:18:18,098 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] [2020-10-16 01:18:18,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:18:18,098 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:18:18,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:18:18,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1739415621, now seen corresponding path program 1 times [2020-10-16 01:18:18,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:18:18,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575448979] [2020-10-16 01:18:18,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:18:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:18:18,229 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 01:18:18,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575448979] [2020-10-16 01:18:18,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:18:18,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:18:18,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326000747] [2020-10-16 01:18:18,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:18:18,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:18:18,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:18:18,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:18:18,232 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 205 [2020-10-16 01:18:18,233 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 198 flow. Second operand 6 states. [2020-10-16 01:18:18,233 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:18:18,233 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 205 [2020-10-16 01:18:18,234 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:18:18,309 INFO L129 PetriNetUnfolder]: 17/58 cut-off events. [2020-10-16 01:18:18,309 INFO L130 PetriNetUnfolder]: For 92/166 co-relation queries the response was YES. [2020-10-16 01:18:18,309 INFO L80 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 58 events. 17/58 cut-off events. For 92/166 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 113 event pairs, 0 based on Foata normal form. 23/77 useless extension candidates. Maximal degree in co-relation 194. Up to 30 conditions per place. [2020-10-16 01:18:18,310 INFO L132 encePairwiseOnDemand]: 199/205 looper letters, 1 selfloop transitions, 17 changer transitions 1/42 dead transitions. [2020-10-16 01:18:18,310 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 234 flow [2020-10-16 01:18:18,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:18:18,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:18:18,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1051 transitions. [2020-10-16 01:18:18,315 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8544715447154472 [2020-10-16 01:18:18,315 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1051 transitions. [2020-10-16 01:18:18,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1051 transitions. [2020-10-16 01:18:18,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:18:18,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1051 transitions. [2020-10-16 01:18:18,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:18:18,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:18:18,320 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:18:18,321 INFO L185 Difference]: Start difference. First operand has 48 places, 42 transitions, 198 flow. Second operand 6 states and 1051 transitions. [2020-10-16 01:18:18,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 234 flow [2020-10-16 01:18:18,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 200 flow, removed 8 selfloop flow, removed 3 redundant places. [2020-10-16 01:18:18,325 INFO L241 Difference]: Finished difference. Result has 51 places, 41 transitions, 206 flow [2020-10-16 01:18:18,326 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2020-10-16 01:18:18,326 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2020-10-16 01:18:18,326 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 206 flow [2020-10-16 01:18:18,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:18:18,326 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:18:18,327 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, 1, 1, 1] [2020-10-16 01:18:18,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:18:18,327 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:18:18,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:18:18,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1574002248, now seen corresponding path program 1 times [2020-10-16 01:18:18,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:18:18,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215062140] [2020-10-16 01:18:18,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:18:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:18:18,633 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 01:18:18,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215062140] [2020-10-16 01:18:18,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:18:18,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:18:18,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004846478] [2020-10-16 01:18:18,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:18:18,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:18:18,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:18:18,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:18:18,637 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 205 [2020-10-16 01:18:18,637 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 206 flow. Second operand 5 states. [2020-10-16 01:18:18,638 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:18:18,638 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 205 [2020-10-16 01:18:18,638 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:18:18,689 INFO L129 PetriNetUnfolder]: 33/93 cut-off events. [2020-10-16 01:18:18,690 INFO L130 PetriNetUnfolder]: For 111/136 co-relation queries the response was YES. [2020-10-16 01:18:18,690 INFO L80 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 93 events. 33/93 cut-off events. For 111/136 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 262 event pairs, 0 based on Foata normal form. 2/85 useless extension candidates. Maximal degree in co-relation 284. Up to 35 conditions per place. [2020-10-16 01:18:18,691 INFO L132 encePairwiseOnDemand]: 201/205 looper letters, 4 selfloop transitions, 2 changer transitions 1/43 dead transitions. [2020-10-16 01:18:18,691 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 43 transitions, 224 flow [2020-10-16 01:18:18,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:18:18,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:18:18,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 853 transitions. [2020-10-16 01:18:18,695 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8321951219512195 [2020-10-16 01:18:18,695 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 853 transitions. [2020-10-16 01:18:18,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 853 transitions. [2020-10-16 01:18:18,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:18:18,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 853 transitions. [2020-10-16 01:18:18,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:18:18,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:18:18,700 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:18:18,701 INFO L185 Difference]: Start difference. First operand has 51 places, 41 transitions, 206 flow. Second operand 5 states and 853 transitions. [2020-10-16 01:18:18,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 43 transitions, 224 flow [2020-10-16 01:18:18,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 43 transitions, 174 flow, removed 12 selfloop flow, removed 4 redundant places. [2020-10-16 01:18:18,704 INFO L241 Difference]: Finished difference. Result has 53 places, 42 transitions, 171 flow [2020-10-16 01:18:18,705 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2020-10-16 01:18:18,705 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2020-10-16 01:18:18,705 INFO L481 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 171 flow [2020-10-16 01:18:18,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:18:18,706 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:18:18,706 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, 1, 1, 1] [2020-10-16 01:18:18,706 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:18:18,706 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:18:18,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:18:18,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1251483350, now seen corresponding path program 2 times [2020-10-16 01:18:18,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:18:18,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821020671] [2020-10-16 01:18:18,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:18:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:18:18,861 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 01:18:18,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821020671] [2020-10-16 01:18:18,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:18:18,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:18:18,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767384195] [2020-10-16 01:18:18,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:18:18,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:18:18,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:18:18,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:18:18,866 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 205 [2020-10-16 01:18:18,867 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 171 flow. Second operand 5 states. [2020-10-16 01:18:18,867 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:18:18,867 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 205 [2020-10-16 01:18:18,868 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:18:18,944 INFO L129 PetriNetUnfolder]: 75/187 cut-off events. [2020-10-16 01:18:18,944 INFO L130 PetriNetUnfolder]: For 146/156 co-relation queries the response was YES. [2020-10-16 01:18:18,945 INFO L80 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 187 events. 75/187 cut-off events. For 146/156 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 785 event pairs, 0 based on Foata normal form. 2/165 useless extension candidates. Maximal degree in co-relation 483. Up to 59 conditions per place. [2020-10-16 01:18:18,948 INFO L132 encePairwiseOnDemand]: 201/205 looper letters, 6 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2020-10-16 01:18:18,948 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 45 transitions, 197 flow [2020-10-16 01:18:18,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:18:18,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:18:18,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 845 transitions. [2020-10-16 01:18:18,951 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.824390243902439 [2020-10-16 01:18:18,951 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 845 transitions. [2020-10-16 01:18:18,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 845 transitions. [2020-10-16 01:18:18,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:18:18,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 845 transitions. [2020-10-16 01:18:18,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:18:18,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:18:18,956 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:18:18,956 INFO L185 Difference]: Start difference. First operand has 53 places, 42 transitions, 171 flow. Second operand 5 states and 845 transitions. [2020-10-16 01:18:18,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 45 transitions, 197 flow [2020-10-16 01:18:18,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 45 transitions, 194 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:18:18,962 INFO L241 Difference]: Finished difference. Result has 57 places, 42 transitions, 177 flow [2020-10-16 01:18:18,962 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2020-10-16 01:18:18,963 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 13 predicate places. [2020-10-16 01:18:18,963 INFO L481 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 177 flow [2020-10-16 01:18:18,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:18:18,963 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:18:18,963 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, 1, 1, 1] [2020-10-16 01:18:18,964 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:18:18,964 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:18:18,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:18:18,964 INFO L82 PathProgramCache]: Analyzing trace with hash -2103115868, now seen corresponding path program 3 times [2020-10-16 01:18:18,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:18:18,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611837969] [2020-10-16 01:18:18,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:18:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:18:19,208 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 01:18:19,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611837969] [2020-10-16 01:18:19,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:18:19,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:18:19,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965750114] [2020-10-16 01:18:19,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:18:19,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:18:19,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:18:19,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:18:19,213 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 205 [2020-10-16 01:18:19,214 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 177 flow. Second operand 7 states. [2020-10-16 01:18:19,214 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:18:19,214 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 205 [2020-10-16 01:18:19,214 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:18:19,584 INFO L129 PetriNetUnfolder]: 559/1148 cut-off events. [2020-10-16 01:18:19,585 INFO L130 PetriNetUnfolder]: For 565/604 co-relation queries the response was YES. [2020-10-16 01:18:19,594 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2855 conditions, 1148 events. 559/1148 cut-off events. For 565/604 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 7341 event pairs, 34 based on Foata normal form. 2/1039 useless extension candidates. Maximal degree in co-relation 2840. Up to 304 conditions per place. [2020-10-16 01:18:19,598 INFO L132 encePairwiseOnDemand]: 197/205 looper letters, 17 selfloop transitions, 8 changer transitions 16/71 dead transitions. [2020-10-16 01:18:19,599 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 71 transitions, 321 flow [2020-10-16 01:18:19,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:18:19,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:18:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1226 transitions. [2020-10-16 01:18:19,604 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7475609756097561 [2020-10-16 01:18:19,604 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1226 transitions. [2020-10-16 01:18:19,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1226 transitions. [2020-10-16 01:18:19,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:18:19,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1226 transitions. [2020-10-16 01:18:19,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:18:19,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:18:19,611 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:18:19,611 INFO L185 Difference]: Start difference. First operand has 57 places, 42 transitions, 177 flow. Second operand 8 states and 1226 transitions. [2020-10-16 01:18:19,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 71 transitions, 321 flow [2020-10-16 01:18:19,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 71 transitions, 314 flow, removed 3 selfloop flow, removed 3 redundant places. [2020-10-16 01:18:19,656 INFO L241 Difference]: Finished difference. Result has 65 places, 48 transitions, 238 flow [2020-10-16 01:18:19,656 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=238, PETRI_PLACES=65, PETRI_TRANSITIONS=48} [2020-10-16 01:18:19,657 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places. [2020-10-16 01:18:19,657 INFO L481 AbstractCegarLoop]: Abstraction has has 65 places, 48 transitions, 238 flow [2020-10-16 01:18:19,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:18:19,657 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:18:19,657 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, 1, 1, 1] [2020-10-16 01:18:19,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:18:19,658 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:18:19,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:18:19,658 INFO L82 PathProgramCache]: Analyzing trace with hash 388881766, now seen corresponding path program 4 times [2020-10-16 01:18:19,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:18:19,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809171700] [2020-10-16 01:18:19,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:18:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:18:19,853 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 01:18:19,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809171700] [2020-10-16 01:18:19,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:18:19,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:18:19,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678310936] [2020-10-16 01:18:19,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:18:19,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:18:19,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:18:19,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:18:19,857 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 205 [2020-10-16 01:18:19,858 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 48 transitions, 238 flow. Second operand 8 states. [2020-10-16 01:18:19,858 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:18:19,859 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 205 [2020-10-16 01:18:19,859 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:18:20,295 INFO L129 PetriNetUnfolder]: 437/1027 cut-off events. [2020-10-16 01:18:20,296 INFO L130 PetriNetUnfolder]: For 1506/1907 co-relation queries the response was YES. [2020-10-16 01:18:20,303 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3266 conditions, 1027 events. 437/1027 cut-off events. For 1506/1907 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 7516 event pairs, 36 based on Foata normal form. 21/962 useless extension candidates. Maximal degree in co-relation 3247. Up to 281 conditions per place. [2020-10-16 01:18:20,308 INFO L132 encePairwiseOnDemand]: 197/205 looper letters, 18 selfloop transitions, 12 changer transitions 5/68 dead transitions. [2020-10-16 01:18:20,308 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 68 transitions, 405 flow [2020-10-16 01:18:20,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:18:20,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:18:20,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1212 transitions. [2020-10-16 01:18:20,313 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7390243902439024 [2020-10-16 01:18:20,313 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1212 transitions. [2020-10-16 01:18:20,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1212 transitions. [2020-10-16 01:18:20,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:18:20,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1212 transitions. [2020-10-16 01:18:20,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:18:20,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:18:20,321 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:18:20,321 INFO L185 Difference]: Start difference. First operand has 65 places, 48 transitions, 238 flow. Second operand 8 states and 1212 transitions. [2020-10-16 01:18:20,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 68 transitions, 405 flow [2020-10-16 01:18:20,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 68 transitions, 379 flow, removed 13 selfloop flow, removed 3 redundant places. [2020-10-16 01:18:20,339 INFO L241 Difference]: Finished difference. Result has 71 places, 56 transitions, 325 flow [2020-10-16 01:18:20,339 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=325, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2020-10-16 01:18:20,340 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 27 predicate places. [2020-10-16 01:18:20,340 INFO L481 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 325 flow [2020-10-16 01:18:20,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:18:20,340 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:18:20,340 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, 1, 1, 1] [2020-10-16 01:18:20,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:18:20,341 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:18:20,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:18:20,341 INFO L82 PathProgramCache]: Analyzing trace with hash 10126456, now seen corresponding path program 5 times [2020-10-16 01:18:20,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:18:20,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142561153] [2020-10-16 01:18:20,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:18:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:18:20,549 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 01:18:20,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142561153] [2020-10-16 01:18:20,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:18:20,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:18:20,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783852937] [2020-10-16 01:18:20,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:18:20,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:18:20,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:18:20,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:18:20,555 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 205 [2020-10-16 01:18:20,557 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 325 flow. Second operand 8 states. [2020-10-16 01:18:20,557 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:18:20,557 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 205 [2020-10-16 01:18:20,558 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:18:21,060 INFO L129 PetriNetUnfolder]: 536/1270 cut-off events. [2020-10-16 01:18:21,060 INFO L130 PetriNetUnfolder]: For 2190/2988 co-relation queries the response was YES. [2020-10-16 01:18:21,069 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4246 conditions, 1270 events. 536/1270 cut-off events. For 2190/2988 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 9868 event pairs, 40 based on Foata normal form. 49/1228 useless extension candidates. Maximal degree in co-relation 4224. Up to 389 conditions per place. [2020-10-16 01:18:21,073 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 27 selfloop transitions, 12 changer transitions 5/77 dead transitions. [2020-10-16 01:18:21,074 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 77 transitions, 549 flow [2020-10-16 01:18:21,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:18:21,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:18:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1195 transitions. [2020-10-16 01:18:21,078 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7286585365853658 [2020-10-16 01:18:21,078 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1195 transitions. [2020-10-16 01:18:21,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1195 transitions. [2020-10-16 01:18:21,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:18:21,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1195 transitions. [2020-10-16 01:18:21,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:18:21,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:18:21,084 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:18:21,085 INFO L185 Difference]: Start difference. First operand has 71 places, 56 transitions, 325 flow. Second operand 8 states and 1195 transitions. [2020-10-16 01:18:21,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 77 transitions, 549 flow [2020-10-16 01:18:21,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 77 transitions, 518 flow, removed 15 selfloop flow, removed 2 redundant places. [2020-10-16 01:18:21,117 INFO L241 Difference]: Finished difference. Result has 79 places, 61 transitions, 403 flow [2020-10-16 01:18:21,118 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=403, PETRI_PLACES=79, PETRI_TRANSITIONS=61} [2020-10-16 01:18:21,118 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 35 predicate places. [2020-10-16 01:18:21,118 INFO L481 AbstractCegarLoop]: Abstraction has has 79 places, 61 transitions, 403 flow [2020-10-16 01:18:21,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:18:21,118 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:18:21,118 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, 1, 1, 1] [2020-10-16 01:18:21,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:18:21,119 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:18:21,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:18:21,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1378922088, now seen corresponding path program 6 times [2020-10-16 01:18:21,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:18:21,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477702307] [2020-10-16 01:18:21,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:18:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:18:21,193 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:18:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:18:21,263 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:18:21,305 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:18:21,305 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:18:21,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:18:21,340 WARN 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 01:18:21,340 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,342 WARN 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 01:18:21,342 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,342 WARN 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 01:18:21,343 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,343 WARN 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 01:18:21,343 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,343 WARN 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 01:18:21,343 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,343 WARN 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 01:18:21,343 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,344 WARN 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 01:18:21,344 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,344 WARN 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 01:18:21,344 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,345 WARN 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 01:18:21,345 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,345 WARN 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 01:18:21,345 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,345 WARN 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 01:18:21,345 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,346 WARN 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 01:18:21,346 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,346 WARN 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 01:18:21,347 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,347 WARN 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 01:18:21,347 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,347 WARN 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 01:18:21,347 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,348 WARN 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 01:18:21,348 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,348 WARN 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 01:18:21,348 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,348 WARN 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 01:18:21,348 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,349 WARN 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 01:18:21,349 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,349 WARN 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 01:18:21,349 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,349 WARN 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 01:18:21,349 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,350 WARN 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 01:18:21,350 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,350 WARN 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 01:18:21,350 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,350 WARN 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 01:18:21,350 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,351 WARN 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 01:18:21,351 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,351 WARN 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 01:18:21,351 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,352 WARN 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 01:18:21,352 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,352 WARN 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 01:18:21,352 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,353 WARN 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 01:18:21,353 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,353 WARN 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 01:18:21,353 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,353 WARN 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 01:18:21,353 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,354 WARN 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 01:18:21,354 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,354 WARN 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 01:18:21,354 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,354 WARN 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 01:18:21,354 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,355 WARN 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 01:18:21,356 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,356 WARN 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 01:18:21,356 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,356 WARN 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 01:18:21,356 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,356 WARN 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 01:18:21,357 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,357 WARN 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 01:18:21,357 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,357 WARN 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 01:18:21,357 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:18:21,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:18:21 BasicIcfg [2020-10-16 01:18:21,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:18:21,461 INFO L168 Benchmark]: Toolchain (without parser) took 11457.12 ms. Allocated memory was 254.8 MB in the beginning and 567.3 MB in the end (delta: 312.5 MB). Free memory was 207.4 MB in the beginning and 220.6 MB in the end (delta: -13.2 MB). Peak memory consumption was 299.3 MB. Max. memory is 14.2 GB. [2020-10-16 01:18:21,461 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 254.8 MB. Free memory is still 228.7 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:18:21,463 INFO L168 Benchmark]: CACSL2BoogieTranslator took 796.20 ms. Allocated memory was 254.8 MB in the beginning and 320.3 MB in the end (delta: 65.5 MB). Free memory was 207.4 MB in the beginning and 268.5 MB in the end (delta: -61.1 MB). Peak memory consumption was 29.7 MB. Max. memory is 14.2 GB. [2020-10-16 01:18:21,463 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.35 ms. Allocated memory is still 320.3 MB. Free memory was 268.5 MB in the beginning and 266.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:18:21,465 INFO L168 Benchmark]: Boogie Preprocessor took 47.57 ms. Allocated memory is still 320.3 MB. Free memory was 266.0 MB in the beginning and 263.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 01:18:21,467 INFO L168 Benchmark]: RCFGBuilder took 2273.98 ms. Allocated memory was 320.3 MB in the beginning and 370.7 MB in the end (delta: 50.3 MB). Free memory was 263.5 MB in the beginning and 337.5 MB in the end (delta: -74.0 MB). Peak memory consumption was 141.0 MB. Max. memory is 14.2 GB. [2020-10-16 01:18:21,472 INFO L168 Benchmark]: TraceAbstraction took 8270.78 ms. Allocated memory was 370.7 MB in the beginning and 567.3 MB in the end (delta: 196.6 MB). Free memory was 337.5 MB in the beginning and 220.6 MB in the end (delta: 116.9 MB). Peak memory consumption was 313.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:18:21,478 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.29 ms. Allocated memory is still 254.8 MB. Free memory is still 228.7 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 796.20 ms. Allocated memory was 254.8 MB in the beginning and 320.3 MB in the end (delta: 65.5 MB). Free memory was 207.4 MB in the beginning and 268.5 MB in the end (delta: -61.1 MB). Peak memory consumption was 29.7 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 63.35 ms. Allocated memory is still 320.3 MB. Free memory was 268.5 MB in the beginning and 266.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 47.57 ms. Allocated memory is still 320.3 MB. Free memory was 266.0 MB in the beginning and 263.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2273.98 ms. Allocated memory was 320.3 MB in the beginning and 370.7 MB in the end (delta: 50.3 MB). Free memory was 263.5 MB in the beginning and 337.5 MB in the end (delta: -74.0 MB). Peak memory consumption was 141.0 MB. Max. memory is 14.2 GB. * TraceAbstraction took 8270.78 ms. Allocated memory was 370.7 MB in the beginning and 567.3 MB in the end (delta: 196.6 MB). Free memory was 337.5 MB in the beginning and 220.6 MB in the end (delta: 116.9 MB). Peak memory consumption was 313.5 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1940 VarBasedMoverChecksPositive, 87 VarBasedMoverChecksNegative, 31 SemBasedMoverChecksPositive, 56 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 324 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.6s, 121 PlacesBefore, 44 PlacesAfterwards, 110 TransitionsBefore, 32 TransitionsAfterwards, 2714 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 91 TotalNumberOfCompositions, 7888 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_p0_EAX = 0; [L703] 0 int __unbuffered_p1_EAX = 0; [L705] 0 int __unbuffered_p2_EAX = 0; [L707] 0 int __unbuffered_p3_EAX = 0; [L709] 0 int __unbuffered_p3_EBX = 0; [L711] 0 int a = 0; [L712] 0 _Bool a$flush_delayed; [L713] 0 int a$mem_tmp; [L714] 0 _Bool a$r_buff0_thd0; [L715] 0 _Bool a$r_buff0_thd1; [L716] 0 _Bool a$r_buff0_thd2; [L717] 0 _Bool a$r_buff0_thd3; [L718] 0 _Bool a$r_buff0_thd4; [L719] 0 _Bool a$r_buff1_thd0; [L720] 0 _Bool a$r_buff1_thd1; [L721] 0 _Bool a$r_buff1_thd2; [L722] 0 _Bool a$r_buff1_thd3; [L723] 0 _Bool a$r_buff1_thd4; [L724] 0 _Bool a$read_delayed; [L725] 0 int *a$read_delayed_var; [L726] 0 int a$w_buff0; [L727] 0 _Bool a$w_buff0_used; [L728] 0 int a$w_buff1; [L729] 0 _Bool a$w_buff1_used; [L730] 0 _Bool main$tmp_guard0; [L731] 0 _Bool main$tmp_guard1; [L733] 0 int x = 0; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L857] 0 pthread_t t441; [L858] FCALL, FORK 0 pthread_create(&t441, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t442; [L860] FCALL, FORK 0 pthread_create(&t442, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t443; [L862] FCALL, FORK 0 pthread_create(&t443, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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] [L863] 0 pthread_t t444; [L864] FCALL, FORK 0 pthread_create(&t444, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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] [L743] 1 a$w_buff1 = a$w_buff0 [L744] 1 a$w_buff0 = 1 [L745] 1 a$w_buff1_used = a$w_buff0_used [L746] 1 a$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L748] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L749] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L750] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L751] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L752] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L753] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L756] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L773] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L793] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, weak$$choice2=0, x=1, y=1, z=0] [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, weak$$choice2=0, x=1, y=1, z=0] [L799] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L799] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L800] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L800] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L801] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L801] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L802] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L802] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L803] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L803] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L779] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L779] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L780] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L781] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L782] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L782] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L783] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L813] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=0, weak$$choice2=0, x=1, y=1, z=1] [L816] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=0, weak$$choice2=0, x=1, y=1, z=1] [L819] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L820] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L821] 4 a$flush_delayed = weak$$choice2 [L822] 4 a$mem_tmp = a [L823] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L823] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L824] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L824] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L825] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L825] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L825] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1 [L825] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L825] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L825] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L826] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L826] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L826] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L826] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L826] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L826] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L827] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L827] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L827] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L828] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L828] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L829] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L829] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 __unbuffered_p3_EBX = a [L831] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L831] 4 a = a$flush_delayed ? a$mem_tmp : a [L832] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=9, weak$$choice2=0, x=1, y=1, z=1] [L835] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L835] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L836] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L836] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L837] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L837] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L838] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L839] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L759] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L759] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L760] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L760] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L761] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L761] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L762] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L762] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L763] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L763] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 1 return 0; [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L842] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L844] 4 return 0; [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=0, x=1, y=1, z=1] [L870] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L870] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L870] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L870] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L871] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L871] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L872] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L872] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L873] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L874] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L877] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=0, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 113 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: 7.9s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 49 SDtfs, 39 SDslu, 56 SDs, 0 SdLazy, 344 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=403occurred in iteration=10, 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.7s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 29856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...