/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/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:21:44,737 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:21:44,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:21:44,775 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:21:44,775 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:21:44,783 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:21:44,785 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:21:44,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:21:44,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:21:44,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:21:44,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:21:44,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:21:44,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:21:44,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:21:44,800 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:21:44,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:21:44,804 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:21:44,805 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:21:44,806 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:21:44,813 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:21:44,815 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:21:44,816 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:21:44,817 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:21:44,817 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:21:44,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:21:44,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:21:44,831 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:21:44,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:21:44,832 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:21:44,836 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:21:44,836 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:21:44,837 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:21:44,838 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:21:44,838 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:21:44,842 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:21:44,842 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:21:44,843 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:21:44,843 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:21:44,844 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:21:44,844 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:21:44,847 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:21:44,848 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-11 18:21:44,885 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:21:44,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:21:44,887 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:21:44,887 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:21:44,887 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:21:44,887 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:21:44,888 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:21:44,888 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:21:44,888 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:21:44,888 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:21:44,888 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:21:44,889 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:21:44,889 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:21:44,889 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:21:44,889 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:21:44,889 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:21:44,890 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:21:44,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:21:44,890 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:21:44,890 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:21:44,890 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:21:44,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:21:44,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:21:44,891 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:21:44,891 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:21:44,891 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:21:44,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:21:44,892 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:21:44,892 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:21:44,892 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:21:45,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:21:45,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:21:45,178 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:21:45,179 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:21:45,179 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:21:45,180 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_rmo.opt.i [2020-10-11 18:21:45,238 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa76f5f4/1296cdde04544b95b221a8af7799ce59/FLAG56c123519 [2020-10-11 18:21:45,708 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:21:45,709 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_rmo.opt.i [2020-10-11 18:21:45,724 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa76f5f4/1296cdde04544b95b221a8af7799ce59/FLAG56c123519 [2020-10-11 18:21:45,981 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa76f5f4/1296cdde04544b95b221a8af7799ce59 [2020-10-11 18:21:45,989 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:21:45,990 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:21:45,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:21:45,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:21:45,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:21:45,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:21:45" (1/1) ... [2020-10-11 18:21:46,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23530ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:45, skipping insertion in model container [2020-10-11 18:21:46,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:21:45" (1/1) ... [2020-10-11 18:21:46,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:21:46,075 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:21:46,645 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:21:46,669 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:21:46,736 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:21:46,847 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:21:46,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:46 WrapperNode [2020-10-11 18:21:46,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:21:46,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:21:46,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:21:46,849 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:21:46,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:46" (1/1) ... [2020-10-11 18:21:46,905 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:46" (1/1) ... [2020-10-11 18:21:46,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:21:46,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:21:46,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:21:46,954 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:21:46,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:46" (1/1) ... [2020-10-11 18:21:46,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:46" (1/1) ... [2020-10-11 18:21:46,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:46" (1/1) ... [2020-10-11 18:21:46,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:46" (1/1) ... [2020-10-11 18:21:46,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:46" (1/1) ... [2020-10-11 18:21:47,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:46" (1/1) ... [2020-10-11 18:21:47,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:46" (1/1) ... [2020-10-11 18:21:47,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:21:47,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:21:47,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:21:47,009 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:21:47,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:46" (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-11 18:21:47,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:21:47,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:21:47,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:21:47,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:21:47,074 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:21:47,075 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:21:47,075 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:21:47,075 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:21:47,075 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:21:47,075 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:21:47,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:21:47,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:21:47,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:21:47,077 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 18:21:48,857 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:21:48,857 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:21:48,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:21:48 BoogieIcfgContainer [2020-10-11 18:21:48,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:21:48,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:21:48,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:21:48,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:21:48,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:21:45" (1/3) ... [2020-10-11 18:21:48,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc24566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:21:48, skipping insertion in model container [2020-10-11 18:21:48,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:46" (2/3) ... [2020-10-11 18:21:48,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc24566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:21:48, skipping insertion in model container [2020-10-11 18:21:48,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:21:48" (3/3) ... [2020-10-11 18:21:48,867 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_rmo.opt.i [2020-10-11 18:21:48,878 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:21:48,886 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:21:48,887 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:21:48,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,915 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,915 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,915 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,916 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,916 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,917 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,918 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,918 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,918 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,918 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,919 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,920 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,920 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,920 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,920 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,921 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,921 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,921 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,921 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,921 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,922 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,922 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,922 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,922 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,923 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,923 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,927 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,927 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,927 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,929 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,930 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,937 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,937 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,938 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:48,955 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-11 18:21:48,975 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:21:48,975 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:21:48,975 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:21:48,975 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:21:48,976 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:21:48,976 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:21:48,976 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:21:48,976 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:21:48,989 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 205 flow [2020-10-11 18:21:49,034 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2020-10-11 18:21:49,034 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:21:49,039 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-11 18:21:49,039 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 95 transitions, 205 flow [2020-10-11 18:21:49,045 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 92 transitions, 193 flow [2020-10-11 18:21:49,060 INFO L129 PetriNetUnfolder]: 0/57 cut-off events. [2020-10-11 18:21:49,060 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:21:49,061 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:21:49,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:21:49,062 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:21:49,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:21:49,068 INFO L82 PathProgramCache]: Analyzing trace with hash -903219512, now seen corresponding path program 1 times [2020-10-11 18:21:49,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:21:49,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295237115] [2020-10-11 18:21:49,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:21:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:21:49,469 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-11 18:21:49,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295237115] [2020-10-11 18:21:49,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:21:49,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:21:49,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459518994] [2020-10-11 18:21:49,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:21:49,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:21:49,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:21:49,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:21:49,583 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 95 [2020-10-11 18:21:49,585 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 92 transitions, 193 flow. Second operand 3 states. [2020-10-11 18:21:49,585 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:21:49,586 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 95 [2020-10-11 18:21:49,587 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:21:49,667 INFO L129 PetriNetUnfolder]: 0/89 cut-off events. [2020-10-11 18:21:49,669 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:21:49,669 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 89 events. 0/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 4/91 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:21:49,671 INFO L132 encePairwiseOnDemand]: 90/95 looper letters, 0 selfloop transitions, 2 changer transitions 11/89 dead transitions. [2020-10-11 18:21:49,672 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 89 transitions, 191 flow [2020-10-11 18:21:49,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:21:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:21:49,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2020-10-11 18:21:49,696 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9719298245614035 [2020-10-11 18:21:49,697 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 277 transitions. [2020-10-11 18:21:49,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 277 transitions. [2020-10-11 18:21:49,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:21:49,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 277 transitions. [2020-10-11 18:21:49,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:21:49,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:21:49,711 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:21:49,713 INFO L185 Difference]: Start difference. First operand has 100 places, 92 transitions, 193 flow. Second operand 3 states and 277 transitions. [2020-10-11 18:21:49,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 89 transitions, 191 flow [2020-10-11 18:21:49,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 89 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-11 18:21:49,721 INFO L241 Difference]: Finished difference. Result has 98 places, 78 transitions, 166 flow [2020-10-11 18:21:49,724 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=98, PETRI_TRANSITIONS=78} [2020-10-11 18:21:49,724 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, -2 predicate places. [2020-10-11 18:21:49,725 INFO L481 AbstractCegarLoop]: Abstraction has has 98 places, 78 transitions, 166 flow [2020-10-11 18:21:49,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:21:49,725 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:21:49,725 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, 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-11 18:21:49,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:21:49,726 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:21:49,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:21:49,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1892047465, now seen corresponding path program 1 times [2020-10-11 18:21:49,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:21:49,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320844936] [2020-10-11 18:21:49,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:21:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:21:50,120 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-11 18:21:50,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320844936] [2020-10-11 18:21:50,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:21:50,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:21:50,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593983432] [2020-10-11 18:21:50,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:21:50,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:21:50,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:21:50,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:21:50,644 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 95 [2020-10-11 18:21:50,645 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 78 transitions, 166 flow. Second operand 11 states. [2020-10-11 18:21:50,645 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:21:50,645 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 95 [2020-10-11 18:21:50,645 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:21:51,123 INFO L129 PetriNetUnfolder]: 108/352 cut-off events. [2020-10-11 18:21:51,123 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-11 18:21:51,128 INFO L80 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 352 events. 108/352 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1705 event pairs, 43 based on Foata normal form. 9/350 useless extension candidates. Maximal degree in co-relation 551. Up to 125 conditions per place. [2020-10-11 18:21:51,134 INFO L132 encePairwiseOnDemand]: 82/95 looper letters, 12 selfloop transitions, 11 changer transitions 34/119 dead transitions. [2020-10-11 18:21:51,134 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 119 transitions, 376 flow [2020-10-11 18:21:51,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-11 18:21:51,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-11 18:21:51,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1276 transitions. [2020-10-11 18:21:51,142 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8394736842105263 [2020-10-11 18:21:51,142 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1276 transitions. [2020-10-11 18:21:51,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1276 transitions. [2020-10-11 18:21:51,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:21:51,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1276 transitions. [2020-10-11 18:21:51,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-11 18:21:51,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-11 18:21:51,155 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-11 18:21:51,156 INFO L185 Difference]: Start difference. First operand has 98 places, 78 transitions, 166 flow. Second operand 16 states and 1276 transitions. [2020-10-11 18:21:51,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 119 transitions, 376 flow [2020-10-11 18:21:51,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 119 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:21:51,162 INFO L241 Difference]: Finished difference. Result has 111 places, 84 transitions, 248 flow [2020-10-11 18:21:51,163 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=248, PETRI_PLACES=111, PETRI_TRANSITIONS=84} [2020-10-11 18:21:51,163 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 11 predicate places. [2020-10-11 18:21:51,165 INFO L481 AbstractCegarLoop]: Abstraction has has 111 places, 84 transitions, 248 flow [2020-10-11 18:21:51,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:21:51,165 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:21:51,166 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, 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-11 18:21:51,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:21:51,166 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:21:51,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:21:51,166 INFO L82 PathProgramCache]: Analyzing trace with hash -190682553, now seen corresponding path program 1 times [2020-10-11 18:21:51,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:21:51,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520183141] [2020-10-11 18:21:51,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:21:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:21:51,395 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-11 18:21:51,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520183141] [2020-10-11 18:21:51,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:21:51,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:21:51,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129981143] [2020-10-11 18:21:51,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:21:51,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:21:51,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:21:51,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:21:51,570 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 95 [2020-10-11 18:21:51,570 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 84 transitions, 248 flow. Second operand 6 states. [2020-10-11 18:21:51,571 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:21:51,571 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 95 [2020-10-11 18:21:51,571 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:21:51,815 INFO L129 PetriNetUnfolder]: 118/381 cut-off events. [2020-10-11 18:21:51,815 INFO L130 PetriNetUnfolder]: For 527/537 co-relation queries the response was YES. [2020-10-11 18:21:51,820 INFO L80 FinitePrefix]: Finished finitePrefix Result has 984 conditions, 381 events. 118/381 cut-off events. For 527/537 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2073 event pairs, 29 based on Foata normal form. 9/373 useless extension candidates. Maximal degree in co-relation 925. Up to 104 conditions per place. [2020-10-11 18:21:51,823 INFO L132 encePairwiseOnDemand]: 88/95 looper letters, 9 selfloop transitions, 3 changer transitions 20/106 dead transitions. [2020-10-11 18:21:51,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 106 transitions, 387 flow [2020-10-11 18:21:51,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:21:51,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:21:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 788 transitions. [2020-10-11 18:21:51,826 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9216374269005848 [2020-10-11 18:21:51,826 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 788 transitions. [2020-10-11 18:21:51,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 788 transitions. [2020-10-11 18:21:51,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:21:51,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 788 transitions. [2020-10-11 18:21:51,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:21:51,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:21:51,832 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:21:51,832 INFO L185 Difference]: Start difference. First operand has 111 places, 84 transitions, 248 flow. Second operand 9 states and 788 transitions. [2020-10-11 18:21:51,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 106 transitions, 387 flow [2020-10-11 18:21:51,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 106 transitions, 367 flow, removed 7 selfloop flow, removed 6 redundant places. [2020-10-11 18:21:51,842 INFO L241 Difference]: Finished difference. Result has 111 places, 86 transitions, 281 flow [2020-10-11 18:21:51,842 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=281, PETRI_PLACES=111, PETRI_TRANSITIONS=86} [2020-10-11 18:21:51,843 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 11 predicate places. [2020-10-11 18:21:51,843 INFO L481 AbstractCegarLoop]: Abstraction has has 111 places, 86 transitions, 281 flow [2020-10-11 18:21:51,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:21:51,843 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:21:51,843 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, 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, 1] [2020-10-11 18:21:51,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:21:51,844 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:21:51,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:21:51,844 INFO L82 PathProgramCache]: Analyzing trace with hash -597027006, now seen corresponding path program 1 times [2020-10-11 18:21:51,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:21:51,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368899037] [2020-10-11 18:21:51,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:21:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:21:52,061 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-11 18:21:52,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368899037] [2020-10-11 18:21:52,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:21:52,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:21:52,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774139234] [2020-10-11 18:21:52,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:21:52,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:21:52,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:21:52,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:21:52,522 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 95 [2020-10-11 18:21:52,523 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 86 transitions, 281 flow. Second operand 8 states. [2020-10-11 18:21:52,523 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:21:52,524 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 95 [2020-10-11 18:21:52,524 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:21:52,847 INFO L129 PetriNetUnfolder]: 220/619 cut-off events. [2020-10-11 18:21:52,848 INFO L130 PetriNetUnfolder]: For 1819/1872 co-relation queries the response was YES. [2020-10-11 18:21:52,852 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2013 conditions, 619 events. 220/619 cut-off events. For 1819/1872 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3673 event pairs, 33 based on Foata normal form. 18/614 useless extension candidates. Maximal degree in co-relation 1949. Up to 183 conditions per place. [2020-10-11 18:21:52,857 INFO L132 encePairwiseOnDemand]: 86/95 looper letters, 18 selfloop transitions, 7 changer transitions 25/118 dead transitions. [2020-10-11 18:21:52,857 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 118 transitions, 619 flow [2020-10-11 18:21:52,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:21:52,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:21:52,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 927 transitions. [2020-10-11 18:21:52,860 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8870813397129187 [2020-10-11 18:21:52,861 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 927 transitions. [2020-10-11 18:21:52,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 927 transitions. [2020-10-11 18:21:52,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:21:52,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 927 transitions. [2020-10-11 18:21:52,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:21:52,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:21:52,866 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:21:52,866 INFO L185 Difference]: Start difference. First operand has 111 places, 86 transitions, 281 flow. Second operand 11 states and 927 transitions. [2020-10-11 18:21:52,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 118 transitions, 619 flow [2020-10-11 18:21:52,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 118 transitions, 596 flow, removed 10 selfloop flow, removed 4 redundant places. [2020-10-11 18:21:52,873 INFO L241 Difference]: Finished difference. Result has 118 places, 88 transitions, 333 flow [2020-10-11 18:21:52,873 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=333, PETRI_PLACES=118, PETRI_TRANSITIONS=88} [2020-10-11 18:21:52,874 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 18 predicate places. [2020-10-11 18:21:52,874 INFO L481 AbstractCegarLoop]: Abstraction has has 118 places, 88 transitions, 333 flow [2020-10-11 18:21:52,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:21:52,874 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:21:52,874 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, 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, 1, 1] [2020-10-11 18:21:52,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:21:52,875 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:21:52,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:21:52,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1110748889, now seen corresponding path program 1 times [2020-10-11 18:21:52,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:21:52,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057798107] [2020-10-11 18:21:52,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:21:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:21:53,157 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-11 18:21:53,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057798107] [2020-10-11 18:21:53,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:21:53,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-11 18:21:53,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167830157] [2020-10-11 18:21:53,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 18:21:53,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:21:53,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 18:21:53,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2020-10-11 18:21:54,993 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 95 [2020-10-11 18:21:54,995 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 88 transitions, 333 flow. Second operand 14 states. [2020-10-11 18:21:54,997 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:21:54,997 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 95 [2020-10-11 18:21:54,997 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:21:55,645 INFO L129 PetriNetUnfolder]: 283/720 cut-off events. [2020-10-11 18:21:55,646 INFO L130 PetriNetUnfolder]: For 4199/4270 co-relation queries the response was YES. [2020-10-11 18:21:55,651 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2980 conditions, 720 events. 283/720 cut-off events. For 4199/4270 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4166 event pairs, 44 based on Foata normal form. 33/727 useless extension candidates. Maximal degree in co-relation 2906. Up to 213 conditions per place. [2020-10-11 18:21:55,656 INFO L132 encePairwiseOnDemand]: 82/95 looper letters, 19 selfloop transitions, 10 changer transitions 39/131 dead transitions. [2020-10-11 18:21:55,656 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 131 transitions, 830 flow [2020-10-11 18:21:55,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-11 18:21:55,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-11 18:21:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1390 transitions. [2020-10-11 18:21:55,662 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8128654970760234 [2020-10-11 18:21:55,662 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1390 transitions. [2020-10-11 18:21:55,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1390 transitions. [2020-10-11 18:21:55,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:21:55,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1390 transitions. [2020-10-11 18:21:55,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 19 states. [2020-10-11 18:21:55,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states. [2020-10-11 18:21:55,670 INFO L81 ComplementDD]: Finished complementDD. Result 19 states. [2020-10-11 18:21:55,670 INFO L185 Difference]: Start difference. First operand has 118 places, 88 transitions, 333 flow. Second operand 18 states and 1390 transitions. [2020-10-11 18:21:55,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 131 transitions, 830 flow [2020-10-11 18:21:55,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 131 transitions, 776 flow, removed 13 selfloop flow, removed 6 redundant places. [2020-10-11 18:21:55,681 INFO L241 Difference]: Finished difference. Result has 134 places, 88 transitions, 367 flow [2020-10-11 18:21:55,681 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=367, PETRI_PLACES=134, PETRI_TRANSITIONS=88} [2020-10-11 18:21:55,681 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 34 predicate places. [2020-10-11 18:21:55,681 INFO L481 AbstractCegarLoop]: Abstraction has has 134 places, 88 transitions, 367 flow [2020-10-11 18:21:55,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 18:21:55,682 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:21:55,682 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, 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, 1, 1, 1, 1] [2020-10-11 18:21:55,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:21:55,682 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:21:55,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:21:55,683 INFO L82 PathProgramCache]: Analyzing trace with hash 311857865, now seen corresponding path program 1 times [2020-10-11 18:21:55,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:21:55,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200850753] [2020-10-11 18:21:55,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:21:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:21:55,953 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-11 18:21:55,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200850753] [2020-10-11 18:21:55,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:21:55,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:21:55,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099260325] [2020-10-11 18:21:55,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:21:55,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:21:55,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:21:55,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:21:56,638 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 95 [2020-10-11 18:21:56,639 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 88 transitions, 367 flow. Second operand 10 states. [2020-10-11 18:21:56,639 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:21:56,640 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 95 [2020-10-11 18:21:56,640 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:21:57,232 INFO L129 PetriNetUnfolder]: 231/583 cut-off events. [2020-10-11 18:21:57,232 INFO L130 PetriNetUnfolder]: For 4737/4767 co-relation queries the response was YES. [2020-10-11 18:21:57,240 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2725 conditions, 583 events. 231/583 cut-off events. For 4737/4767 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3227 event pairs, 55 based on Foata normal form. 26/589 useless extension candidates. Maximal degree in co-relation 2640. Up to 232 conditions per place. [2020-10-11 18:21:57,247 INFO L132 encePairwiseOnDemand]: 83/95 looper letters, 22 selfloop transitions, 12 changer transitions 34/132 dead transitions. [2020-10-11 18:21:57,247 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 132 transitions, 932 flow [2020-10-11 18:21:57,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-11 18:21:57,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-11 18:21:57,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1275 transitions. [2020-10-11 18:21:57,254 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8388157894736842 [2020-10-11 18:21:57,255 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1275 transitions. [2020-10-11 18:21:57,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1275 transitions. [2020-10-11 18:21:57,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:21:57,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1275 transitions. [2020-10-11 18:21:57,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-11 18:21:57,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-11 18:21:57,266 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-11 18:21:57,266 INFO L185 Difference]: Start difference. First operand has 134 places, 88 transitions, 367 flow. Second operand 16 states and 1275 transitions. [2020-10-11 18:21:57,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 132 transitions, 932 flow [2020-10-11 18:21:57,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 132 transitions, 833 flow, removed 39 selfloop flow, removed 19 redundant places. [2020-10-11 18:21:57,284 INFO L241 Difference]: Finished difference. Result has 133 places, 97 transitions, 490 flow [2020-10-11 18:21:57,284 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=490, PETRI_PLACES=133, PETRI_TRANSITIONS=97} [2020-10-11 18:21:57,286 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 33 predicate places. [2020-10-11 18:21:57,287 INFO L481 AbstractCegarLoop]: Abstraction has has 133 places, 97 transitions, 490 flow [2020-10-11 18:21:57,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:21:57,287 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:21:57,288 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, 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, 1, 1, 1, 1] [2020-10-11 18:21:57,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:21:57,288 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:21:57,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:21:57,289 INFO L82 PathProgramCache]: Analyzing trace with hash -270037077, now seen corresponding path program 2 times [2020-10-11 18:21:57,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:21:57,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922678375] [2020-10-11 18:21:57,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:21:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:21:57,638 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-11 18:21:57,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922678375] [2020-10-11 18:21:57,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:21:57,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:21:57,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777697067] [2020-10-11 18:21:57,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:21:57,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:21:57,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:21:57,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:21:58,139 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 95 [2020-10-11 18:21:58,140 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 97 transitions, 490 flow. Second operand 11 states. [2020-10-11 18:21:58,140 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:21:58,140 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 95 [2020-10-11 18:21:58,140 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:21:58,474 INFO L129 PetriNetUnfolder]: 178/500 cut-off events. [2020-10-11 18:21:58,474 INFO L130 PetriNetUnfolder]: For 5614/5703 co-relation queries the response was YES. [2020-10-11 18:21:58,479 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2629 conditions, 500 events. 178/500 cut-off events. For 5614/5703 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2687 event pairs, 43 based on Foata normal form. 36/517 useless extension candidates. Maximal degree in co-relation 2547. Up to 169 conditions per place. [2020-10-11 18:21:58,482 INFO L132 encePairwiseOnDemand]: 83/95 looper letters, 17 selfloop transitions, 15 changer transitions 28/124 dead transitions. [2020-10-11 18:21:58,482 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 124 transitions, 1036 flow [2020-10-11 18:21:58,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:21:58,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:21:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1110 transitions. [2020-10-11 18:21:58,487 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8345864661654135 [2020-10-11 18:21:58,487 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1110 transitions. [2020-10-11 18:21:58,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1110 transitions. [2020-10-11 18:21:58,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:21:58,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1110 transitions. [2020-10-11 18:21:58,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:21:58,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:21:58,494 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:21:58,494 INFO L185 Difference]: Start difference. First operand has 133 places, 97 transitions, 490 flow. Second operand 14 states and 1110 transitions. [2020-10-11 18:21:58,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 124 transitions, 1036 flow [2020-10-11 18:21:58,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 124 transitions, 989 flow, removed 18 selfloop flow, removed 6 redundant places. [2020-10-11 18:21:58,506 INFO L241 Difference]: Finished difference. Result has 137 places, 96 transitions, 496 flow [2020-10-11 18:21:58,506 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=496, PETRI_PLACES=137, PETRI_TRANSITIONS=96} [2020-10-11 18:21:58,506 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 37 predicate places. [2020-10-11 18:21:58,506 INFO L481 AbstractCegarLoop]: Abstraction has has 137 places, 96 transitions, 496 flow [2020-10-11 18:21:58,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:21:58,507 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:21:58,507 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, 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, 1, 1, 1, 1, 1, 1] [2020-10-11 18:21:58,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:21:58,507 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:21:58,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:21:58,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1471392506, now seen corresponding path program 1 times [2020-10-11 18:21:58,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:21:58,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441359557] [2020-10-11 18:21:58,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:21:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:21:58,843 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-11 18:21:58,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441359557] [2020-10-11 18:21:58,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:21:58,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-11 18:21:58,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199072921] [2020-10-11 18:21:58,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 18:21:58,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:21:58,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 18:21:58,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2020-10-11 18:22:00,472 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 95 [2020-10-11 18:22:00,473 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 96 transitions, 496 flow. Second operand 14 states. [2020-10-11 18:22:00,473 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:00,473 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 95 [2020-10-11 18:22:00,473 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:00,849 INFO L129 PetriNetUnfolder]: 117/371 cut-off events. [2020-10-11 18:22:00,849 INFO L130 PetriNetUnfolder]: For 5492/5583 co-relation queries the response was YES. [2020-10-11 18:22:00,852 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2020 conditions, 371 events. 117/371 cut-off events. For 5492/5583 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1735 event pairs, 16 based on Foata normal form. 24/381 useless extension candidates. Maximal degree in co-relation 1930. Up to 157 conditions per place. [2020-10-11 18:22:00,856 INFO L132 encePairwiseOnDemand]: 82/95 looper letters, 27 selfloop transitions, 13 changer transitions 10/112 dead transitions. [2020-10-11 18:22:00,856 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 112 transitions, 864 flow [2020-10-11 18:22:00,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:22:00,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:22:00,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1148 transitions. [2020-10-11 18:22:00,860 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8056140350877193 [2020-10-11 18:22:00,860 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1148 transitions. [2020-10-11 18:22:00,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1148 transitions. [2020-10-11 18:22:00,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:00,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1148 transitions. [2020-10-11 18:22:00,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:22:00,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:22:00,867 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:22:00,867 INFO L185 Difference]: Start difference. First operand has 137 places, 96 transitions, 496 flow. Second operand 15 states and 1148 transitions. [2020-10-11 18:22:00,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 112 transitions, 864 flow [2020-10-11 18:22:00,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 112 transitions, 778 flow, removed 32 selfloop flow, removed 12 redundant places. [2020-10-11 18:22:00,877 INFO L241 Difference]: Finished difference. Result has 140 places, 99 transitions, 564 flow [2020-10-11 18:22:00,878 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=564, PETRI_PLACES=140, PETRI_TRANSITIONS=99} [2020-10-11 18:22:00,878 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 40 predicate places. [2020-10-11 18:22:00,878 INFO L481 AbstractCegarLoop]: Abstraction has has 140 places, 99 transitions, 564 flow [2020-10-11 18:22:00,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 18:22:00,878 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:00,878 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, 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, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:00,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:22:00,879 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:00,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:00,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1181744822, now seen corresponding path program 2 times [2020-10-11 18:22:00,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:00,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973000007] [2020-10-11 18:22:00,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:01,148 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-11 18:22:01,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973000007] [2020-10-11 18:22:01,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:01,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:22:01,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152844743] [2020-10-11 18:22:01,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:22:01,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:01,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:22:01,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:22:02,216 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 95 [2020-10-11 18:22:02,216 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 99 transitions, 564 flow. Second operand 11 states. [2020-10-11 18:22:02,217 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:02,217 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 95 [2020-10-11 18:22:02,217 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:02,554 INFO L129 PetriNetUnfolder]: 123/403 cut-off events. [2020-10-11 18:22:02,554 INFO L130 PetriNetUnfolder]: For 7045/7201 co-relation queries the response was YES. [2020-10-11 18:22:02,558 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2209 conditions, 403 events. 123/403 cut-off events. For 7045/7201 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2035 event pairs, 18 based on Foata normal form. 26/416 useless extension candidates. Maximal degree in co-relation 2120. Up to 170 conditions per place. [2020-10-11 18:22:02,562 INFO L132 encePairwiseOnDemand]: 83/95 looper letters, 31 selfloop transitions, 13 changer transitions 10/118 dead transitions. [2020-10-11 18:22:02,563 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 118 transitions, 986 flow [2020-10-11 18:22:02,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:22:02,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:22:02,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1025 transitions. [2020-10-11 18:22:02,568 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8299595141700404 [2020-10-11 18:22:02,568 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1025 transitions. [2020-10-11 18:22:02,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1025 transitions. [2020-10-11 18:22:02,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:02,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1025 transitions. [2020-10-11 18:22:02,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:22:02,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:22:02,575 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:22:02,575 INFO L185 Difference]: Start difference. First operand has 140 places, 99 transitions, 564 flow. Second operand 13 states and 1025 transitions. [2020-10-11 18:22:02,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 118 transitions, 986 flow [2020-10-11 18:22:02,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 118 transitions, 839 flow, removed 61 selfloop flow, removed 13 redundant places. [2020-10-11 18:22:02,592 INFO L241 Difference]: Finished difference. Result has 141 places, 104 transitions, 607 flow [2020-10-11 18:22:02,592 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=607, PETRI_PLACES=141, PETRI_TRANSITIONS=104} [2020-10-11 18:22:02,592 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 41 predicate places. [2020-10-11 18:22:02,592 INFO L481 AbstractCegarLoop]: Abstraction has has 141 places, 104 transitions, 607 flow [2020-10-11 18:22:02,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:22:02,593 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:02,593 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, 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, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:02,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:22:02,593 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:02,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:02,594 INFO L82 PathProgramCache]: Analyzing trace with hash 35608618, now seen corresponding path program 3 times [2020-10-11 18:22:02,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:02,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808033523] [2020-10-11 18:22:02,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:02,924 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-11 18:22:02,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808033523] [2020-10-11 18:22:02,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:02,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:22:02,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529706980] [2020-10-11 18:22:02,925 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:22:02,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:02,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:22:02,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:22:04,560 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 95 [2020-10-11 18:22:04,561 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 104 transitions, 607 flow. Second operand 13 states. [2020-10-11 18:22:04,561 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:04,561 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 95 [2020-10-11 18:22:04,562 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:04,786 INFO L129 PetriNetUnfolder]: 125/419 cut-off events. [2020-10-11 18:22:04,786 INFO L130 PetriNetUnfolder]: For 7309/7511 co-relation queries the response was YES. [2020-10-11 18:22:04,790 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2303 conditions, 419 events. 125/419 cut-off events. For 7309/7511 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2148 event pairs, 16 based on Foata normal form. 36/442 useless extension candidates. Maximal degree in co-relation 2214. Up to 175 conditions per place. [2020-10-11 18:22:04,794 INFO L132 encePairwiseOnDemand]: 83/95 looper letters, 32 selfloop transitions, 16 changer transitions 7/119 dead transitions. [2020-10-11 18:22:04,794 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 119 transitions, 1003 flow [2020-10-11 18:22:04,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:22:04,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:22:04,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 868 transitions. [2020-10-11 18:22:04,797 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.830622009569378 [2020-10-11 18:22:04,797 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 868 transitions. [2020-10-11 18:22:04,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 868 transitions. [2020-10-11 18:22:04,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:04,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 868 transitions. [2020-10-11 18:22:04,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:22:04,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:22:04,800 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:22:04,800 INFO L185 Difference]: Start difference. First operand has 141 places, 104 transitions, 607 flow. Second operand 11 states and 868 transitions. [2020-10-11 18:22:04,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 119 transitions, 1003 flow [2020-10-11 18:22:04,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 119 transitions, 887 flow, removed 52 selfloop flow, removed 9 redundant places. [2020-10-11 18:22:04,817 INFO L241 Difference]: Finished difference. Result has 140 places, 109 transitions, 669 flow [2020-10-11 18:22:04,817 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=669, PETRI_PLACES=140, PETRI_TRANSITIONS=109} [2020-10-11 18:22:04,817 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 40 predicate places. [2020-10-11 18:22:04,817 INFO L481 AbstractCegarLoop]: Abstraction has has 140 places, 109 transitions, 669 flow [2020-10-11 18:22:04,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:22:04,818 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:04,818 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, 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, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:04,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 18:22:04,818 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:04,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:04,818 INFO L82 PathProgramCache]: Analyzing trace with hash -881454988, now seen corresponding path program 4 times [2020-10-11 18:22:04,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:04,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282868160] [2020-10-11 18:22:04,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:05,032 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-11 18:22:05,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282868160] [2020-10-11 18:22:05,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:05,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:22:05,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995594673] [2020-10-11 18:22:05,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:22:05,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:05,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:22:05,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:22:05,720 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 95 [2020-10-11 18:22:05,720 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 109 transitions, 669 flow. Second operand 11 states. [2020-10-11 18:22:05,720 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:05,720 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 95 [2020-10-11 18:22:05,720 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:06,038 INFO L129 PetriNetUnfolder]: 102/460 cut-off events. [2020-10-11 18:22:06,038 INFO L130 PetriNetUnfolder]: For 5625/5770 co-relation queries the response was YES. [2020-10-11 18:22:06,042 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2075 conditions, 460 events. 102/460 cut-off events. For 5625/5770 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2636 event pairs, 8 based on Foata normal form. 45/493 useless extension candidates. Maximal degree in co-relation 1987. Up to 104 conditions per place. [2020-10-11 18:22:06,045 INFO L132 encePairwiseOnDemand]: 85/95 looper letters, 30 selfloop transitions, 14 changer transitions 10/124 dead transitions. [2020-10-11 18:22:06,045 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 124 transitions, 1015 flow [2020-10-11 18:22:06,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:22:06,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:22:06,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1048 transitions. [2020-10-11 18:22:06,048 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.848582995951417 [2020-10-11 18:22:06,048 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1048 transitions. [2020-10-11 18:22:06,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1048 transitions. [2020-10-11 18:22:06,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:06,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1048 transitions. [2020-10-11 18:22:06,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:22:06,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:22:06,052 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:22:06,052 INFO L185 Difference]: Start difference. First operand has 140 places, 109 transitions, 669 flow. Second operand 13 states and 1048 transitions. [2020-10-11 18:22:06,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 124 transitions, 1015 flow [2020-10-11 18:22:06,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 124 transitions, 909 flow, removed 41 selfloop flow, removed 9 redundant places. [2020-10-11 18:22:06,068 INFO L241 Difference]: Finished difference. Result has 147 places, 109 transitions, 644 flow [2020-10-11 18:22:06,068 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=644, PETRI_PLACES=147, PETRI_TRANSITIONS=109} [2020-10-11 18:22:06,068 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 47 predicate places. [2020-10-11 18:22:06,068 INFO L481 AbstractCegarLoop]: Abstraction has has 147 places, 109 transitions, 644 flow [2020-10-11 18:22:06,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:22:06,069 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:06,069 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, 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, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:06,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 18:22:06,069 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:06,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:06,069 INFO L82 PathProgramCache]: Analyzing trace with hash -504795868, now seen corresponding path program 1 times [2020-10-11 18:22:06,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:06,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569328817] [2020-10-11 18:22:06,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:06,165 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-11 18:22:06,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569328817] [2020-10-11 18:22:06,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:06,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:22:06,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151926441] [2020-10-11 18:22:06,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:22:06,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:06,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:22:06,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:22:06,274 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 95 [2020-10-11 18:22:06,274 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 109 transitions, 644 flow. Second operand 6 states. [2020-10-11 18:22:06,274 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:06,274 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 95 [2020-10-11 18:22:06,274 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:06,538 INFO L129 PetriNetUnfolder]: 422/1199 cut-off events. [2020-10-11 18:22:06,538 INFO L130 PetriNetUnfolder]: For 4655/4694 co-relation queries the response was YES. [2020-10-11 18:22:06,548 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3531 conditions, 1199 events. 422/1199 cut-off events. For 4655/4694 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 9230 event pairs, 89 based on Foata normal form. 41/1131 useless extension candidates. Maximal degree in co-relation 3443. Up to 295 conditions per place. [2020-10-11 18:22:06,555 INFO L132 encePairwiseOnDemand]: 86/95 looper letters, 19 selfloop transitions, 16 changer transitions 0/134 dead transitions. [2020-10-11 18:22:06,555 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 134 transitions, 764 flow [2020-10-11 18:22:06,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:22:06,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:22:06,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 775 transitions. [2020-10-11 18:22:06,557 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9064327485380117 [2020-10-11 18:22:06,558 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 775 transitions. [2020-10-11 18:22:06,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 775 transitions. [2020-10-11 18:22:06,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:06,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 775 transitions. [2020-10-11 18:22:06,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:22:06,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:22:06,561 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:22:06,561 INFO L185 Difference]: Start difference. First operand has 147 places, 109 transitions, 644 flow. Second operand 9 states and 775 transitions. [2020-10-11 18:22:06,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 134 transitions, 764 flow [2020-10-11 18:22:06,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 134 transitions, 710 flow, removed 22 selfloop flow, removed 13 redundant places. [2020-10-11 18:22:06,577 INFO L241 Difference]: Finished difference. Result has 141 places, 123 transitions, 701 flow [2020-10-11 18:22:06,577 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=701, PETRI_PLACES=141, PETRI_TRANSITIONS=123} [2020-10-11 18:22:06,578 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 41 predicate places. [2020-10-11 18:22:06,578 INFO L481 AbstractCegarLoop]: Abstraction has has 141 places, 123 transitions, 701 flow [2020-10-11 18:22:06,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:22:06,578 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:06,578 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, 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:06,578 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 18:22:06,579 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:06,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:06,579 INFO L82 PathProgramCache]: Analyzing trace with hash -21947644, now seen corresponding path program 1 times [2020-10-11 18:22:06,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:06,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708478168] [2020-10-11 18:22:06,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:06,687 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-11 18:22:06,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708478168] [2020-10-11 18:22:06,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:06,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:22:06,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804815943] [2020-10-11 18:22:06,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:22:06,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:06,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:22:06,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:22:06,804 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 95 [2020-10-11 18:22:06,804 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 123 transitions, 701 flow. Second operand 7 states. [2020-10-11 18:22:06,804 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:06,804 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 95 [2020-10-11 18:22:06,805 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:07,138 INFO L129 PetriNetUnfolder]: 319/1024 cut-off events. [2020-10-11 18:22:07,138 INFO L130 PetriNetUnfolder]: For 3117/5217 co-relation queries the response was YES. [2020-10-11 18:22:07,146 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3477 conditions, 1024 events. 319/1024 cut-off events. For 3117/5217 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 8019 event pairs, 12 based on Foata normal form. 212/1137 useless extension candidates. Maximal degree in co-relation 3394. Up to 315 conditions per place. [2020-10-11 18:22:07,151 INFO L132 encePairwiseOnDemand]: 86/95 looper letters, 15 selfloop transitions, 31 changer transitions 6/138 dead transitions. [2020-10-11 18:22:07,152 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 138 transitions, 855 flow [2020-10-11 18:22:07,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:22:07,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:22:07,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1034 transitions. [2020-10-11 18:22:07,154 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9070175438596492 [2020-10-11 18:22:07,154 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1034 transitions. [2020-10-11 18:22:07,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1034 transitions. [2020-10-11 18:22:07,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:07,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1034 transitions. [2020-10-11 18:22:07,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:22:07,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:22:07,157 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:22:07,158 INFO L185 Difference]: Start difference. First operand has 141 places, 123 transitions, 701 flow. Second operand 12 states and 1034 transitions. [2020-10-11 18:22:07,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 138 transitions, 855 flow [2020-10-11 18:22:07,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 138 transitions, 830 flow, removed 3 selfloop flow, removed 6 redundant places. [2020-10-11 18:22:07,169 INFO L241 Difference]: Finished difference. Result has 149 places, 129 transitions, 775 flow [2020-10-11 18:22:07,170 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=775, PETRI_PLACES=149, PETRI_TRANSITIONS=129} [2020-10-11 18:22:07,170 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 49 predicate places. [2020-10-11 18:22:07,170 INFO L481 AbstractCegarLoop]: Abstraction has has 149 places, 129 transitions, 775 flow [2020-10-11 18:22:07,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:22:07,170 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:07,170 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:07,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 18:22:07,171 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:07,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:07,171 INFO L82 PathProgramCache]: Analyzing trace with hash -572298967, now seen corresponding path program 1 times [2020-10-11 18:22:07,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:07,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586957553] [2020-10-11 18:22:07,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:07,255 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-11 18:22:07,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586957553] [2020-10-11 18:22:07,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:07,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:22:07,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734207969] [2020-10-11 18:22:07,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:22:07,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:07,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:22:07,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:22:07,410 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 95 [2020-10-11 18:22:07,411 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 129 transitions, 775 flow. Second operand 6 states. [2020-10-11 18:22:07,411 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:07,411 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 95 [2020-10-11 18:22:07,411 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:07,696 INFO L129 PetriNetUnfolder]: 350/1288 cut-off events. [2020-10-11 18:22:07,696 INFO L130 PetriNetUnfolder]: For 5351/6248 co-relation queries the response was YES. [2020-10-11 18:22:07,702 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4645 conditions, 1288 events. 350/1288 cut-off events. For 5351/6248 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 11040 event pairs, 16 based on Foata normal form. 17/1196 useless extension candidates. Maximal degree in co-relation 4561. Up to 388 conditions per place. [2020-10-11 18:22:07,706 INFO L132 encePairwiseOnDemand]: 89/95 looper letters, 12 selfloop transitions, 3 changer transitions 10/143 dead transitions. [2020-10-11 18:22:07,707 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 143 transitions, 953 flow [2020-10-11 18:22:07,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:22:07,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:22:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 782 transitions. [2020-10-11 18:22:07,709 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9146198830409357 [2020-10-11 18:22:07,709 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 782 transitions. [2020-10-11 18:22:07,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 782 transitions. [2020-10-11 18:22:07,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:07,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 782 transitions. [2020-10-11 18:22:07,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:22:07,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:22:07,712 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:22:07,712 INFO L185 Difference]: Start difference. First operand has 149 places, 129 transitions, 775 flow. Second operand 9 states and 782 transitions. [2020-10-11 18:22:07,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 143 transitions, 953 flow [2020-10-11 18:22:07,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 143 transitions, 831 flow, removed 48 selfloop flow, removed 6 redundant places. [2020-10-11 18:22:07,744 INFO L241 Difference]: Finished difference. Result has 158 places, 129 transitions, 682 flow [2020-10-11 18:22:07,745 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=682, PETRI_PLACES=158, PETRI_TRANSITIONS=129} [2020-10-11 18:22:07,745 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 58 predicate places. [2020-10-11 18:22:07,745 INFO L481 AbstractCegarLoop]: Abstraction has has 158 places, 129 transitions, 682 flow [2020-10-11 18:22:07,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:22:07,745 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:07,746 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:07,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 18:22:07,746 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:07,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:07,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1093955395, now seen corresponding path program 1 times [2020-10-11 18:22:07,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:07,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601795195] [2020-10-11 18:22:07,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:07,864 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-11 18:22:07,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601795195] [2020-10-11 18:22:07,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:07,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:22:07,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920290983] [2020-10-11 18:22:07,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:22:07,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:07,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:22:07,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:22:08,056 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 95 [2020-10-11 18:22:08,057 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 129 transitions, 682 flow. Second operand 8 states. [2020-10-11 18:22:08,057 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:08,057 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 95 [2020-10-11 18:22:08,057 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:08,499 INFO L129 PetriNetUnfolder]: 391/1263 cut-off events. [2020-10-11 18:22:08,499 INFO L130 PetriNetUnfolder]: For 1772/4627 co-relation queries the response was YES. [2020-10-11 18:22:08,509 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3618 conditions, 1263 events. 391/1263 cut-off events. For 1772/4627 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 11048 event pairs, 0 based on Foata normal form. 340/1457 useless extension candidates. Maximal degree in co-relation 3567. Up to 252 conditions per place. [2020-10-11 18:22:08,512 INFO L132 encePairwiseOnDemand]: 86/95 looper letters, 10 selfloop transitions, 36 changer transitions 18/145 dead transitions. [2020-10-11 18:22:08,513 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 145 transitions, 882 flow [2020-10-11 18:22:08,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:22:08,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:22:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1281 transitions. [2020-10-11 18:22:08,516 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8989473684210526 [2020-10-11 18:22:08,516 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1281 transitions. [2020-10-11 18:22:08,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1281 transitions. [2020-10-11 18:22:08,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:08,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1281 transitions. [2020-10-11 18:22:08,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:22:08,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:22:08,520 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:22:08,520 INFO L185 Difference]: Start difference. First operand has 158 places, 129 transitions, 682 flow. Second operand 15 states and 1281 transitions. [2020-10-11 18:22:08,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 145 transitions, 882 flow [2020-10-11 18:22:08,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 145 transitions, 772 flow, removed 45 selfloop flow, removed 23 redundant places. [2020-10-11 18:22:08,537 INFO L241 Difference]: Finished difference. Result has 149 places, 124 transitions, 652 flow [2020-10-11 18:22:08,537 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=652, PETRI_PLACES=149, PETRI_TRANSITIONS=124} [2020-10-11 18:22:08,538 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 49 predicate places. [2020-10-11 18:22:08,538 INFO L481 AbstractCegarLoop]: Abstraction has has 149 places, 124 transitions, 652 flow [2020-10-11 18:22:08,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:22:08,538 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:08,538 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:08,538 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 18:22:08,539 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:08,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:08,539 INFO L82 PathProgramCache]: Analyzing trace with hash 528219753, now seen corresponding path program 1 times [2020-10-11 18:22:08,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:08,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633922259] [2020-10-11 18:22:08,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:08,637 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-11 18:22:08,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633922259] [2020-10-11 18:22:08,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:08,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:22:08,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432608870] [2020-10-11 18:22:08,640 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:22:08,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:08,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:22:08,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:22:08,888 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 95 [2020-10-11 18:22:08,889 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 124 transitions, 652 flow. Second operand 7 states. [2020-10-11 18:22:08,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:08,889 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 95 [2020-10-11 18:22:08,889 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:09,060 INFO L129 PetriNetUnfolder]: 233/960 cut-off events. [2020-10-11 18:22:09,060 INFO L130 PetriNetUnfolder]: For 1909/2117 co-relation queries the response was YES. [2020-10-11 18:22:09,065 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2698 conditions, 960 events. 233/960 cut-off events. For 1909/2117 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 8171 event pairs, 0 based on Foata normal form. 2/885 useless extension candidates. Maximal degree in co-relation 2623. Up to 132 conditions per place. [2020-10-11 18:22:09,066 INFO L132 encePairwiseOnDemand]: 89/95 looper letters, 9 selfloop transitions, 1 changer transitions 17/129 dead transitions. [2020-10-11 18:22:09,066 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 129 transitions, 696 flow [2020-10-11 18:22:09,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 18:22:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-11 18:22:09,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 597 transitions. [2020-10-11 18:22:09,068 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8977443609022556 [2020-10-11 18:22:09,068 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 597 transitions. [2020-10-11 18:22:09,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 597 transitions. [2020-10-11 18:22:09,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:09,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 597 transitions. [2020-10-11 18:22:09,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-11 18:22:09,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-11 18:22:09,070 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-11 18:22:09,070 INFO L185 Difference]: Start difference. First operand has 149 places, 124 transitions, 652 flow. Second operand 7 states and 597 transitions. [2020-10-11 18:22:09,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 129 transitions, 696 flow [2020-10-11 18:22:09,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 129 transitions, 610 flow, removed 9 selfloop flow, removed 17 redundant places. [2020-10-11 18:22:09,091 INFO L241 Difference]: Finished difference. Result has 141 places, 112 transitions, 496 flow [2020-10-11 18:22:09,091 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=496, PETRI_PLACES=141, PETRI_TRANSITIONS=112} [2020-10-11 18:22:09,091 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 41 predicate places. [2020-10-11 18:22:09,091 INFO L481 AbstractCegarLoop]: Abstraction has has 141 places, 112 transitions, 496 flow [2020-10-11 18:22:09,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:22:09,091 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:09,092 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:09,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-11 18:22:09,092 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:09,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:09,092 INFO L82 PathProgramCache]: Analyzing trace with hash -862063223, now seen corresponding path program 2 times [2020-10-11 18:22:09,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:09,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266937302] [2020-10-11 18:22:09,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:22:09,125 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:22:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:22:09,178 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:22:09,250 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:22:09,250 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:22:09,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-11 18:22:09,312 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,313 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,315 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,315 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,315 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,315 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,316 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,316 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,316 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,316 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,318 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,318 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,318 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,319 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,319 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,320 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,320 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,320 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,321 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,321 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,322 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,322 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,324 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,324 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,325 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,325 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,325 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,325 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,326 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,326 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,326 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,326 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,327 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,327 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,332 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,332 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,332 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,332 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,333 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,333 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,333 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,333 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,333 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,333 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,333 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,334 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,334 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,334 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,334 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,334 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,334 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,334 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,335 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,335 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,335 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:22:09,335 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:09,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:22:09 BasicIcfg [2020-10-11 18:22:09,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:22:09,475 INFO L168 Benchmark]: Toolchain (without parser) took 23483.69 ms. Allocated memory was 254.8 MB in the beginning and 696.8 MB in the end (delta: 442.0 MB). Free memory was 210.8 MB in the beginning and 434.4 MB in the end (delta: -223.6 MB). Peak memory consumption was 218.3 MB. Max. memory is 14.2 GB. [2020-10-11 18:22:09,476 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 254.8 MB. Free memory is still 231.2 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:22:09,477 INFO L168 Benchmark]: CACSL2BoogieTranslator took 857.46 ms. Allocated memory was 254.8 MB in the beginning and 324.5 MB in the end (delta: 69.7 MB). Free memory was 210.8 MB in the beginning and 277.1 MB in the end (delta: -66.3 MB). Peak memory consumption was 35.8 MB. Max. memory is 14.2 GB. [2020-10-11 18:22:09,478 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.59 ms. Allocated memory is still 324.5 MB. Free memory was 277.1 MB in the beginning and 274.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:22:09,486 INFO L168 Benchmark]: Boogie Preprocessor took 54.32 ms. Allocated memory is still 324.5 MB. Free memory was 274.6 MB in the beginning and 272.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:22:09,487 INFO L168 Benchmark]: RCFGBuilder took 1850.65 ms. Allocated memory was 324.5 MB in the beginning and 362.8 MB in the end (delta: 38.3 MB). Free memory was 272.1 MB in the beginning and 219.0 MB in the end (delta: 53.1 MB). Peak memory consumption was 101.7 MB. Max. memory is 14.2 GB. [2020-10-11 18:22:09,488 INFO L168 Benchmark]: TraceAbstraction took 20612.02 ms. Allocated memory was 362.8 MB in the beginning and 696.8 MB in the end (delta: 334.0 MB). Free memory was 219.0 MB in the beginning and 434.4 MB in the end (delta: -215.5 MB). Peak memory consumption was 118.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:22:09,497 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 254.8 MB. Free memory is still 231.2 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 857.46 ms. Allocated memory was 254.8 MB in the beginning and 324.5 MB in the end (delta: 69.7 MB). Free memory was 210.8 MB in the beginning and 277.1 MB in the end (delta: -66.3 MB). Peak memory consumption was 35.8 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 104.59 ms. Allocated memory is still 324.5 MB. Free memory was 277.1 MB in the beginning and 274.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 54.32 ms. Allocated memory is still 324.5 MB. Free memory was 274.6 MB in the beginning and 272.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1850.65 ms. Allocated memory was 324.5 MB in the beginning and 362.8 MB in the end (delta: 38.3 MB). Free memory was 272.1 MB in the beginning and 219.0 MB in the end (delta: 53.1 MB). Peak memory consumption was 101.7 MB. Max. memory is 14.2 GB. * TraceAbstraction took 20612.02 ms. Allocated memory was 362.8 MB in the beginning and 696.8 MB in the end (delta: 334.0 MB). Free memory was 219.0 MB in the beginning and 434.4 MB in the end (delta: -215.5 MB). Peak memory consumption was 118.5 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L700] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L702] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L704] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L705] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L706] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L708] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L710] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L711] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L712] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L713] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L714] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L715] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L716] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L717] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L718] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L719] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L720] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L721] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L722] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L723] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L724] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L725] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L726] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L728] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] 0 pthread_t t1208; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] FCALL, FORK 0 pthread_create(&t1208, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] 0 pthread_t t1209; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] FCALL, FORK 0 pthread_create(&t1209, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] 0 pthread_t t1210; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] FCALL, FORK 0 pthread_create(&t1210, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L769] 3 y$w_buff1 = y$w_buff0 [L770] 3 y$w_buff0 = 2 [L771] 3 y$w_buff1_used = y$w_buff0_used [L772] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L774] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L775] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L776] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L777] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L778] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L784] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L755] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L755] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L758] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L759] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L794] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L742] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L827] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L830] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 0 y$flush_delayed = weak$$choice2 [L833] 0 y$mem_tmp = y [L834] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L835] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L842] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L842] 0 y = y$flush_delayed ? y$mem_tmp : y [L843] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 94 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: 20.2s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 573 SDtfs, 901 SDslu, 2955 SDs, 0 SdLazy, 2586 SolverSat, 405 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=775occurred in iteration=13, 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, 2.6s InterpolantComputationTime, 1066 NumberOfCodeBlocks, 1066 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 978 ConstructedInterpolants, 0 QuantifiedInterpolants, 372425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...