/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 20:11:02,791 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 20:11:02,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 20:11:02,835 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 20:11:02,835 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 20:11:02,839 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 20:11:02,842 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 20:11:02,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 20:11:02,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 20:11:02,856 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 20:11:02,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 20:11:02,858 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 20:11:02,858 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 20:11:02,860 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 20:11:02,862 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 20:11:02,863 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 20:11:02,866 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 20:11:02,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 20:11:02,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 20:11:02,877 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 20:11:02,879 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 20:11:02,881 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 20:11:02,882 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 20:11:02,883 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 20:11:02,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 20:11:02,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 20:11:02,886 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 20:11:02,887 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 20:11:02,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 20:11:02,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 20:11:02,888 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 20:11:02,889 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 20:11:02,890 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 20:11:02,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 20:11:02,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 20:11:02,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 20:11:02,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 20:11:02,893 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 20:11:02,893 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 20:11:02,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 20:11:02,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 20:11:02,895 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2021-03-11 20:11:02,928 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 20:11:02,928 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 20:11:02,932 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 20:11:02,932 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 20:11:02,932 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 20:11:02,933 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 20:11:02,933 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 20:11:02,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 20:11:02,933 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 20:11:02,933 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 20:11:02,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 20:11:02,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 20:11:02,934 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 20:11:02,934 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 20:11:02,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 20:11:02,935 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 20:11:02,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 20:11:02,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 20:11:02,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 20:11:02,935 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 20:11:02,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 20:11:02,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:11:02,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 20:11:02,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 20:11:02,936 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 20:11:02,936 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 20:11:02,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 20:11:02,936 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 20:11:02,937 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-11 20:11:03,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 20:11:03,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 20:11:03,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 20:11:03,231 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 20:11:03,232 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 20:11:03,233 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2021-03-11 20:11:03,294 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb5a641f/fb1e71e7efa8474e9cf8a7e7984c0262/FLAGa2ed3425c [2021-03-11 20:11:03,866 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 20:11:03,868 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2021-03-11 20:11:03,885 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb5a641f/fb1e71e7efa8474e9cf8a7e7984c0262/FLAGa2ed3425c [2021-03-11 20:11:04,299 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb5a641f/fb1e71e7efa8474e9cf8a7e7984c0262 [2021-03-11 20:11:04,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 20:11:04,306 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 20:11:04,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 20:11:04,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 20:11:04,310 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 20:11:04,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:11:04" (1/1) ... [2021-03-11 20:11:04,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4de15db9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:11:04, skipping insertion in model container [2021-03-11 20:11:04,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:11:04" (1/1) ... [2021-03-11 20:11:04,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 20:11:04,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 20:11:04,467 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i[949,962] [2021-03-11 20:11:04,726 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:11:04,737 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 20:11:04,747 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i[949,962] [2021-03-11 20:11:04,811 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:11:04,888 INFO L208 MainTranslator]: Completed translation [2021-03-11 20:11:04,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:11:04 WrapperNode [2021-03-11 20:11:04,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 20:11:04,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 20:11:04,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 20:11:04,891 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 20:11:04,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:11:04" (1/1) ... [2021-03-11 20:11:04,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:11:04" (1/1) ... [2021-03-11 20:11:04,971 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 20:11:04,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 20:11:04,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 20:11:04,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 20:11:04,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:11:04" (1/1) ... [2021-03-11 20:11:04,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:11:04" (1/1) ... [2021-03-11 20:11:04,995 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:11:04" (1/1) ... [2021-03-11 20:11:04,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:11:04" (1/1) ... [2021-03-11 20:11:05,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:11:04" (1/1) ... [2021-03-11 20:11:05,009 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:11:04" (1/1) ... [2021-03-11 20:11:05,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:11:04" (1/1) ... [2021-03-11 20:11:05,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 20:11:05,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 20:11:05,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 20:11:05,034 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 20:11:05,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:11:04" (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 [2021-03-11 20:11:05,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 20:11:05,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 20:11:05,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 20:11:05,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 20:11:05,089 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 20:11:05,090 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 20:11:05,090 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 20:11:05,090 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 20:11:05,090 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 20:11:05,090 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 20:11:05,090 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-11 20:11:05,090 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-11 20:11:05,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 20:11:05,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 20:11:05,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 20:11:05,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 20:11:05,092 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 20:11:07,004 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 20:11:07,004 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 20:11:07,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:11:07 BoogieIcfgContainer [2021-03-11 20:11:07,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 20:11:07,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 20:11:07,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 20:11:07,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 20:11:07,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:11:04" (1/3) ... [2021-03-11 20:11:07,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52ec7b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:11:07, skipping insertion in model container [2021-03-11 20:11:07,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:11:04" (2/3) ... [2021-03-11 20:11:07,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52ec7b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:11:07, skipping insertion in model container [2021-03-11 20:11:07,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:11:07" (3/3) ... [2021-03-11 20:11:07,013 INFO L111 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i [2021-03-11 20:11:07,018 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 20:11:07,022 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 20:11:07,023 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 20:11:07,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,061 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,062 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,062 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,062 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,065 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,065 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,065 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,066 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,067 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,067 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,067 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,068 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,068 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,068 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,069 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,075 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,078 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,078 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,079 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,079 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,083 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,083 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,083 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,083 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,087 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,087 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,087 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,087 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,093 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,094 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,094 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,094 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,095 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,096 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,098 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,098 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,098 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,098 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,098 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,098 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,098 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,098 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,099 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,099 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,100 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,101 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,102 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,102 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,102 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:07,104 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 20:11:07,120 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-11 20:11:07,149 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 20:11:07,149 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 20:11:07,150 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 20:11:07,150 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 20:11:07,150 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 20:11:07,150 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 20:11:07,150 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 20:11:07,150 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 20:11:07,162 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 119 transitions, 258 flow [2021-03-11 20:11:07,198 INFO L129 PetriNetUnfolder]: 2/115 cut-off events. [2021-03-11 20:11:07,198 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:11:07,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-11 20:11:07,202 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 119 transitions, 258 flow [2021-03-11 20:11:07,206 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 115 transitions, 242 flow [2021-03-11 20:11:07,209 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 20:11:07,216 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 115 transitions, 242 flow [2021-03-11 20:11:07,218 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 115 transitions, 242 flow [2021-03-11 20:11:07,219 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 242 flow [2021-03-11 20:11:07,238 INFO L129 PetriNetUnfolder]: 2/115 cut-off events. [2021-03-11 20:11:07,238 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:11:07,239 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-11 20:11:07,241 INFO L116 LiptonReduction]: Number of co-enabled transitions 2868 [2021-03-11 20:11:07,886 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-11 20:11:08,290 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-11 20:11:08,427 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-11 20:11:10,177 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-11 20:11:10,300 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-11 20:11:12,111 WARN L205 SmtUtils]: Spent 942.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 191 [2021-03-11 20:11:12,380 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-11 20:11:13,741 WARN L205 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 316 DAG size of output: 272 [2021-03-11 20:11:14,319 WARN L205 SmtUtils]: Spent 576.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-11 20:11:16,410 WARN L205 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-11 20:11:16,561 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-11 20:11:16,893 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-11 20:11:17,039 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-11 20:11:17,043 INFO L131 LiptonReduction]: Checked pairs total: 8567 [2021-03-11 20:11:17,043 INFO L133 LiptonReduction]: Total number of compositions: 95 [2021-03-11 20:11:17,044 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9838 [2021-03-11 20:11:17,051 INFO L129 PetriNetUnfolder]: 0/8 cut-off events. [2021-03-11 20:11:17,051 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:11:17,051 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:17,051 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-03-11 20:11:17,052 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:17,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:17,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1169912557, now seen corresponding path program 1 times [2021-03-11 20:11:17,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:17,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409053] [2021-03-11 20:11:17,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:17,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:17,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:11:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:11:17,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409053] [2021-03-11 20:11:17,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:17,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:11:17,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100490084] [2021-03-11 20:11:17,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:11:17,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:17,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:11:17,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:11:17,331 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 214 [2021-03-11 20:11:17,335 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:17,336 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:17,336 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 214 [2021-03-11 20:11:17,337 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:17,473 INFO L129 PetriNetUnfolder]: 133/300 cut-off events. [2021-03-11 20:11:17,474 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:11:17,476 INFO L84 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 300 events. 133/300 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1556 event pairs, 87 based on Foata normal form. 21/282 useless extension candidates. Maximal degree in co-relation 508. Up to 153 conditions per place. [2021-03-11 20:11:17,479 INFO L132 encePairwiseOnDemand]: 210/214 looper letters, 11 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2021-03-11 20:11:17,480 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 108 flow [2021-03-11 20:11:17,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:11:17,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:11:17,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2021-03-11 20:11:17,502 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8660436137071651 [2021-03-11 20:11:17,504 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 556 transitions. [2021-03-11 20:11:17,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 556 transitions. [2021-03-11 20:11:17,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:17,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 556 transitions. [2021-03-11 20:11:17,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:17,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:17,523 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:17,525 INFO L185 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 556 transitions. [2021-03-11 20:11:17,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 108 flow [2021-03-11 20:11:17,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 35 transitions, 104 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-11 20:11:17,530 INFO L241 Difference]: Finished difference. Result has 41 places, 30 transitions, 72 flow [2021-03-11 20:11:17,532 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2021-03-11 20:11:17,532 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2021-03-11 20:11:17,532 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 72 flow [2021-03-11 20:11:17,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:17,533 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:17,533 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:11:17,533 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 20:11:17,533 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:17,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:17,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1393932240, now seen corresponding path program 1 times [2021-03-11 20:11:17,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:17,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350961095] [2021-03-11 20:11:17,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:17,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:17,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:17,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:17,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:11:17,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:11:17,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350961095] [2021-03-11 20:11:17,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:17,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:11:17,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805727439] [2021-03-11 20:11:17,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:11:17,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:17,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:11:17,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:11:17,686 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 214 [2021-03-11 20:11:17,686 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 177.75) internal successors, (711), 4 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:17,686 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:17,686 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 214 [2021-03-11 20:11:17,686 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:17,712 INFO L129 PetriNetUnfolder]: 2/38 cut-off events. [2021-03-11 20:11:17,712 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:11:17,713 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 38 events. 2/38 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/37 useless extension candidates. Maximal degree in co-relation 52. Up to 4 conditions per place. [2021-03-11 20:11:17,713 INFO L132 encePairwiseOnDemand]: 209/214 looper letters, 2 selfloop transitions, 2 changer transitions 5/34 dead transitions. [2021-03-11 20:11:17,713 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 34 transitions, 98 flow [2021-03-11 20:11:17,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:11:17,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:11:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 896 transitions. [2021-03-11 20:11:17,716 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8373831775700935 [2021-03-11 20:11:17,716 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 896 transitions. [2021-03-11 20:11:17,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 896 transitions. [2021-03-11 20:11:17,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:17,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 896 transitions. [2021-03-11 20:11:17,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 179.2) internal successors, (896), 5 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:17,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:17,727 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:17,727 INFO L185 Difference]: Start difference. First operand has 41 places, 30 transitions, 72 flow. Second operand 5 states and 896 transitions. [2021-03-11 20:11:17,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 34 transitions, 98 flow [2021-03-11 20:11:17,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 34 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:11:17,729 INFO L241 Difference]: Finished difference. Result has 46 places, 29 transitions, 78 flow [2021-03-11 20:11:17,729 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=46, PETRI_TRANSITIONS=29} [2021-03-11 20:11:17,729 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2021-03-11 20:11:17,729 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 78 flow [2021-03-11 20:11:17,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 177.75) internal successors, (711), 4 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:17,730 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:17,730 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:11:17,730 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 20:11:17,730 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:17,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:17,731 INFO L82 PathProgramCache]: Analyzing trace with hash -697076362, now seen corresponding path program 1 times [2021-03-11 20:11:17,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:17,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895423635] [2021-03-11 20:11:17,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:17,899 INFO L142 QuantifierPusher]: treesize reduction 16, result has 72.9 percent of original size [2021-03-11 20:11:17,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-03-11 20:11:17,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:17,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 20:11:17,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:17,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:11:17,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:11:17,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895423635] [2021-03-11 20:11:17,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:17,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:11:17,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080195265] [2021-03-11 20:11:17,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:11:17,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:17,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:11:17,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:11:17,952 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 214 [2021-03-11 20:11:17,953 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 29 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 150.8) internal successors, (754), 5 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:17,953 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:17,953 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 214 [2021-03-11 20:11:17,953 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:18,173 INFO L129 PetriNetUnfolder]: 297/536 cut-off events. [2021-03-11 20:11:18,176 INFO L130 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2021-03-11 20:11:18,180 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1090 conditions, 536 events. 297/536 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2839 event pairs, 152 based on Foata normal form. 36/547 useless extension candidates. Maximal degree in co-relation 1078. Up to 305 conditions per place. [2021-03-11 20:11:18,187 INFO L132 encePairwiseOnDemand]: 210/214 looper letters, 13 selfloop transitions, 2 changer transitions 11/45 dead transitions. [2021-03-11 20:11:18,188 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 164 flow [2021-03-11 20:11:18,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:11:18,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:11:18,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 778 transitions. [2021-03-11 20:11:18,191 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7271028037383177 [2021-03-11 20:11:18,191 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 778 transitions. [2021-03-11 20:11:18,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 778 transitions. [2021-03-11 20:11:18,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:18,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 778 transitions. [2021-03-11 20:11:18,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 155.6) internal successors, (778), 5 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:18,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:18,196 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:18,196 INFO L185 Difference]: Start difference. First operand has 46 places, 29 transitions, 78 flow. Second operand 5 states and 778 transitions. [2021-03-11 20:11:18,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 164 flow [2021-03-11 20:11:18,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 156 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-11 20:11:18,201 INFO L241 Difference]: Finished difference. Result has 46 places, 29 transitions, 82 flow [2021-03-11 20:11:18,201 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=29} [2021-03-11 20:11:18,201 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2021-03-11 20:11:18,202 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 82 flow [2021-03-11 20:11:18,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 150.8) internal successors, (754), 5 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:18,202 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:18,202 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:11:18,202 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 20:11:18,203 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:18,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:18,203 INFO L82 PathProgramCache]: Analyzing trace with hash -2049665676, now seen corresponding path program 1 times [2021-03-11 20:11:18,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:18,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373434901] [2021-03-11 20:11:18,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:18,317 INFO L142 QuantifierPusher]: treesize reduction 47, result has 23.0 percent of original size [2021-03-11 20:11:18,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 20:11:18,327 INFO L142 QuantifierPusher]: treesize reduction 47, result has 23.0 percent of original size [2021-03-11 20:11:18,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 20:11:18,338 INFO L142 QuantifierPusher]: treesize reduction 5, result has 88.1 percent of original size [2021-03-11 20:11:18,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-11 20:11:18,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:18,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:11:18,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:11:18,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373434901] [2021-03-11 20:11:18,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:18,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:11:18,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46118171] [2021-03-11 20:11:18,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:11:18,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:18,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:11:18,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:11:18,370 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 214 [2021-03-11 20:11:18,371 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 29 transitions, 82 flow. Second operand has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:18,372 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:18,372 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 214 [2021-03-11 20:11:18,372 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:18,603 INFO L129 PetriNetUnfolder]: 313/587 cut-off events. [2021-03-11 20:11:18,604 INFO L130 PetriNetUnfolder]: For 202/202 co-relation queries the response was YES. [2021-03-11 20:11:18,606 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1247 conditions, 587 events. 313/587 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3146 event pairs, 29 based on Foata normal form. 34/595 useless extension candidates. Maximal degree in co-relation 1234. Up to 299 conditions per place. [2021-03-11 20:11:18,608 INFO L132 encePairwiseOnDemand]: 206/214 looper letters, 15 selfloop transitions, 6 changer transitions 11/51 dead transitions. [2021-03-11 20:11:18,609 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 51 transitions, 194 flow [2021-03-11 20:11:18,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:11:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:11:18,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 958 transitions. [2021-03-11 20:11:18,612 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7461059190031153 [2021-03-11 20:11:18,612 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 958 transitions. [2021-03-11 20:11:18,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 958 transitions. [2021-03-11 20:11:18,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:18,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 958 transitions. [2021-03-11 20:11:18,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 159.66666666666666) internal successors, (958), 6 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:18,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:18,619 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:18,619 INFO L185 Difference]: Start difference. First operand has 46 places, 29 transitions, 82 flow. Second operand 6 states and 958 transitions. [2021-03-11 20:11:18,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 51 transitions, 194 flow [2021-03-11 20:11:18,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 51 transitions, 186 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-11 20:11:18,623 INFO L241 Difference]: Finished difference. Result has 48 places, 33 transitions, 121 flow [2021-03-11 20:11:18,623 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=121, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2021-03-11 20:11:18,624 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2021-03-11 20:11:18,624 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 121 flow [2021-03-11 20:11:18,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:18,624 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:18,625 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:11:18,625 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 20:11:18,625 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:18,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:18,625 INFO L82 PathProgramCache]: Analyzing trace with hash -2061472931, now seen corresponding path program 1 times [2021-03-11 20:11:18,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:18,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885337620] [2021-03-11 20:11:18,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:18,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:18,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:18,726 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-11 20:11:18,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:11:18,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:18,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:11:18,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:11:18,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885337620] [2021-03-11 20:11:18,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:18,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:11:18,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338009900] [2021-03-11 20:11:18,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:11:18,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:18,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:11:18,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:11:18,739 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 214 [2021-03-11 20:11:18,740 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:18,740 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:18,740 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 214 [2021-03-11 20:11:18,741 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:18,903 INFO L129 PetriNetUnfolder]: 397/772 cut-off events. [2021-03-11 20:11:18,903 INFO L130 PetriNetUnfolder]: For 355/388 co-relation queries the response was YES. [2021-03-11 20:11:18,907 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1879 conditions, 772 events. 397/772 cut-off events. For 355/388 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 4947 event pairs, 215 based on Foata normal form. 57/747 useless extension candidates. Maximal degree in co-relation 1865. Up to 363 conditions per place. [2021-03-11 20:11:18,911 INFO L132 encePairwiseOnDemand]: 207/214 looper letters, 10 selfloop transitions, 10 changer transitions 0/46 dead transitions. [2021-03-11 20:11:18,911 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 187 flow [2021-03-11 20:11:18,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:11:18,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:11:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 897 transitions. [2021-03-11 20:11:18,914 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8383177570093457 [2021-03-11 20:11:18,914 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 897 transitions. [2021-03-11 20:11:18,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 897 transitions. [2021-03-11 20:11:18,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:18,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 897 transitions. [2021-03-11 20:11:18,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 179.4) internal successors, (897), 5 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:18,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:18,919 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:18,919 INFO L185 Difference]: Start difference. First operand has 48 places, 33 transitions, 121 flow. Second operand 5 states and 897 transitions. [2021-03-11 20:11:18,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 187 flow [2021-03-11 20:11:18,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 178 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-11 20:11:18,923 INFO L241 Difference]: Finished difference. Result has 50 places, 42 transitions, 187 flow [2021-03-11 20:11:18,923 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2021-03-11 20:11:18,924 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2021-03-11 20:11:18,924 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 187 flow [2021-03-11 20:11:18,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:18,924 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:18,924 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:11:18,925 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 20:11:18,925 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:18,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:18,925 INFO L82 PathProgramCache]: Analyzing trace with hash -269045132, now seen corresponding path program 1 times [2021-03-11 20:11:18,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:18,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640882035] [2021-03-11 20:11:18,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:19,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:19,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:19,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:19,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:19,031 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-11 20:11:19,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:11:19,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:19,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:11:19,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:11:19,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640882035] [2021-03-11 20:11:19,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:19,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:11:19,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335006468] [2021-03-11 20:11:19,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:11:19,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:19,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:11:19,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:11:19,044 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 214 [2021-03-11 20:11:19,044 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 187 flow. Second operand has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:19,044 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:19,045 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 214 [2021-03-11 20:11:19,045 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:19,166 INFO L129 PetriNetUnfolder]: 270/602 cut-off events. [2021-03-11 20:11:19,166 INFO L130 PetriNetUnfolder]: For 787/2129 co-relation queries the response was YES. [2021-03-11 20:11:19,169 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2119 conditions, 602 events. 270/602 cut-off events. For 787/2129 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3921 event pairs, 82 based on Foata normal form. 200/742 useless extension candidates. Maximal degree in co-relation 2103. Up to 358 conditions per place. [2021-03-11 20:11:19,173 INFO L132 encePairwiseOnDemand]: 207/214 looper letters, 10 selfloop transitions, 19 changer transitions 0/55 dead transitions. [2021-03-11 20:11:19,173 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 321 flow [2021-03-11 20:11:19,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:11:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:11:19,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1256 transitions. [2021-03-11 20:11:19,176 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8384512683578104 [2021-03-11 20:11:19,176 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1256 transitions. [2021-03-11 20:11:19,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1256 transitions. [2021-03-11 20:11:19,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:19,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1256 transitions. [2021-03-11 20:11:19,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 179.42857142857142) internal successors, (1256), 7 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:19,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:19,182 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:19,182 INFO L185 Difference]: Start difference. First operand has 50 places, 42 transitions, 187 flow. Second operand 7 states and 1256 transitions. [2021-03-11 20:11:19,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 321 flow [2021-03-11 20:11:19,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 20:11:19,187 INFO L241 Difference]: Finished difference. Result has 58 places, 51 transitions, 316 flow [2021-03-11 20:11:19,187 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=316, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2021-03-11 20:11:19,187 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2021-03-11 20:11:19,187 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 316 flow [2021-03-11 20:11:19,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:19,188 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:19,188 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] [2021-03-11 20:11:19,188 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 20:11:19,188 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:19,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:19,188 INFO L82 PathProgramCache]: Analyzing trace with hash -709450069, now seen corresponding path program 1 times [2021-03-11 20:11:19,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:19,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965614437] [2021-03-11 20:11:19,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:19,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:19,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:19,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:19,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:19,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:19,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:19,308 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-11 20:11:19,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:11:19,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:19,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:11:19,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:11:19,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965614437] [2021-03-11 20:11:19,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:19,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:11:19,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23165918] [2021-03-11 20:11:19,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:11:19,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:19,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:11:19,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:11:19,321 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 214 [2021-03-11 20:11:19,322 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 316 flow. Second operand has 6 states, 6 states have (on average 175.83333333333334) internal successors, (1055), 6 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:19,322 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:19,322 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 214 [2021-03-11 20:11:19,322 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:19,458 INFO L129 PetriNetUnfolder]: 196/475 cut-off events. [2021-03-11 20:11:19,458 INFO L130 PetriNetUnfolder]: For 1883/4544 co-relation queries the response was YES. [2021-03-11 20:11:19,461 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2313 conditions, 475 events. 196/475 cut-off events. For 1883/4544 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3007 event pairs, 30 based on Foata normal form. 300/722 useless extension candidates. Maximal degree in co-relation 2293. Up to 330 conditions per place. [2021-03-11 20:11:19,464 INFO L132 encePairwiseOnDemand]: 207/214 looper letters, 6 selfloop transitions, 28 changer transitions 4/64 dead transitions. [2021-03-11 20:11:19,464 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 64 transitions, 518 flow [2021-03-11 20:11:19,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 20:11:19,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 20:11:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1615 transitions. [2021-03-11 20:11:19,468 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8385254413291796 [2021-03-11 20:11:19,468 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1615 transitions. [2021-03-11 20:11:19,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1615 transitions. [2021-03-11 20:11:19,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:19,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1615 transitions. [2021-03-11 20:11:19,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 179.44444444444446) internal successors, (1615), 9 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:19,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 214.0) internal successors, (2140), 10 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:19,478 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 214.0) internal successors, (2140), 10 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:19,478 INFO L185 Difference]: Start difference. First operand has 58 places, 51 transitions, 316 flow. Second operand 9 states and 1615 transitions. [2021-03-11 20:11:19,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 64 transitions, 518 flow [2021-03-11 20:11:19,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 64 transitions, 468 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-03-11 20:11:19,487 INFO L241 Difference]: Finished difference. Result has 66 places, 60 transitions, 444 flow [2021-03-11 20:11:19,487 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=444, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2021-03-11 20:11:19,488 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 22 predicate places. [2021-03-11 20:11:19,488 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 444 flow [2021-03-11 20:11:19,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 175.83333333333334) internal successors, (1055), 6 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:19,488 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:19,488 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] [2021-03-11 20:11:19,488 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 20:11:19,488 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:19,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:19,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1802940477, now seen corresponding path program 1 times [2021-03-11 20:11:19,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:19,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181248330] [2021-03-11 20:11:19,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:19,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:19,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:19,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:19,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:19,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:19,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:19,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:19,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:19,597 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-11 20:11:19,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:11:19,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:19,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:11:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:11:19,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181248330] [2021-03-11 20:11:19,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:19,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 20:11:19,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784697874] [2021-03-11 20:11:19,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 20:11:19,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:19,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 20:11:19,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-11 20:11:19,611 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 214 [2021-03-11 20:11:19,612 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 444 flow. Second operand has 7 states, 7 states have (on average 175.85714285714286) internal successors, (1231), 7 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:19,612 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:19,612 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 214 [2021-03-11 20:11:19,612 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:19,760 INFO L129 PetriNetUnfolder]: 174/428 cut-off events. [2021-03-11 20:11:19,760 INFO L130 PetriNetUnfolder]: For 2321/3923 co-relation queries the response was YES. [2021-03-11 20:11:19,764 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2223 conditions, 428 events. 174/428 cut-off events. For 2321/3923 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2748 event pairs, 22 based on Foata normal form. 265/641 useless extension candidates. Maximal degree in co-relation 2200. Up to 202 conditions per place. [2021-03-11 20:11:19,766 INFO L132 encePairwiseOnDemand]: 207/214 looper letters, 2 selfloop transitions, 33 changer transitions 4/65 dead transitions. [2021-03-11 20:11:19,767 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 65 transitions, 578 flow [2021-03-11 20:11:19,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-11 20:11:19,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-11 20:11:19,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1966 transitions. [2021-03-11 20:11:19,772 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8351741716227697 [2021-03-11 20:11:19,772 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1966 transitions. [2021-03-11 20:11:19,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1966 transitions. [2021-03-11 20:11:19,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:19,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1966 transitions. [2021-03-11 20:11:19,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 178.72727272727272) internal successors, (1966), 11 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:19,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 214.0) internal successors, (2568), 12 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:19,782 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 214.0) internal successors, (2568), 12 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:19,782 INFO L185 Difference]: Start difference. First operand has 66 places, 60 transitions, 444 flow. Second operand 11 states and 1966 transitions. [2021-03-11 20:11:19,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 65 transitions, 578 flow [2021-03-11 20:11:19,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 65 transitions, 469 flow, removed 38 selfloop flow, removed 6 redundant places. [2021-03-11 20:11:19,796 INFO L241 Difference]: Finished difference. Result has 73 places, 61 transitions, 429 flow [2021-03-11 20:11:19,796 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=429, PETRI_PLACES=73, PETRI_TRANSITIONS=61} [2021-03-11 20:11:19,797 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 29 predicate places. [2021-03-11 20:11:19,797 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 61 transitions, 429 flow [2021-03-11 20:11:19,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 175.85714285714286) internal successors, (1231), 7 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:19,797 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:19,797 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] [2021-03-11 20:11:19,797 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 20:11:19,798 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:19,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:19,798 INFO L82 PathProgramCache]: Analyzing trace with hash 651149540, now seen corresponding path program 1 times [2021-03-11 20:11:19,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:19,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195763250] [2021-03-11 20:11:19,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:19,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:19,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:11:19,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:19,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:19,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:19,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:19,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:19,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:11:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:11:19,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195763250] [2021-03-11 20:11:19,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:19,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:11:19,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612041349] [2021-03-11 20:11:19,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:11:19,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:19,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:11:19,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:11:19,879 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 214 [2021-03-11 20:11:19,880 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 61 transitions, 429 flow. Second operand has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:19,880 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:19,880 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 214 [2021-03-11 20:11:19,880 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:19,989 INFO L129 PetriNetUnfolder]: 337/805 cut-off events. [2021-03-11 20:11:19,989 INFO L130 PetriNetUnfolder]: For 2160/2505 co-relation queries the response was YES. [2021-03-11 20:11:19,994 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3260 conditions, 805 events. 337/805 cut-off events. For 2160/2505 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 5761 event pairs, 43 based on Foata normal form. 2/714 useless extension candidates. Maximal degree in co-relation 3235. Up to 215 conditions per place. [2021-03-11 20:11:19,998 INFO L132 encePairwiseOnDemand]: 210/214 looper letters, 4 selfloop transitions, 2 changer transitions 1/63 dead transitions. [2021-03-11 20:11:19,998 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 63 transitions, 447 flow [2021-03-11 20:11:19,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:11:19,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:11:20,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 858 transitions. [2021-03-11 20:11:20,001 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8018691588785046 [2021-03-11 20:11:20,001 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 858 transitions. [2021-03-11 20:11:20,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 858 transitions. [2021-03-11 20:11:20,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:20,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 858 transitions. [2021-03-11 20:11:20,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 171.6) internal successors, (858), 5 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:20,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:20,005 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:20,006 INFO L185 Difference]: Start difference. First operand has 73 places, 61 transitions, 429 flow. Second operand 5 states and 858 transitions. [2021-03-11 20:11:20,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 63 transitions, 447 flow [2021-03-11 20:11:20,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 63 transitions, 328 flow, removed 29 selfloop flow, removed 11 redundant places. [2021-03-11 20:11:20,029 INFO L241 Difference]: Finished difference. Result has 68 places, 62 transitions, 325 flow [2021-03-11 20:11:20,029 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=325, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2021-03-11 20:11:20,030 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 24 predicate places. [2021-03-11 20:11:20,030 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 325 flow [2021-03-11 20:11:20,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:20,030 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:20,030 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] [2021-03-11 20:11:20,030 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 20:11:20,030 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:20,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:20,031 INFO L82 PathProgramCache]: Analyzing trace with hash -862078530, now seen corresponding path program 2 times [2021-03-11 20:11:20,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:20,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637807837] [2021-03-11 20:11:20,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:20,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:20,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:11:20,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:20,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:20,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:20,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:11:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:11:20,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637807837] [2021-03-11 20:11:20,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:20,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:11:20,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756498972] [2021-03-11 20:11:20,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:11:20,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:20,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:11:20,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:11:20,112 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 214 [2021-03-11 20:11:20,113 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 325 flow. Second operand has 4 states, 4 states have (on average 174.25) internal successors, (697), 4 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:20,113 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:20,113 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 214 [2021-03-11 20:11:20,113 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:20,356 INFO L129 PetriNetUnfolder]: 669/1566 cut-off events. [2021-03-11 20:11:20,356 INFO L130 PetriNetUnfolder]: For 2166/2268 co-relation queries the response was YES. [2021-03-11 20:11:20,366 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5100 conditions, 1566 events. 669/1566 cut-off events. For 2166/2268 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 13096 event pairs, 85 based on Foata normal form. 2/1391 useless extension candidates. Maximal degree in co-relation 5080. Up to 425 conditions per place. [2021-03-11 20:11:20,372 INFO L132 encePairwiseOnDemand]: 210/214 looper letters, 4 selfloop transitions, 2 changer transitions 1/64 dead transitions. [2021-03-11 20:11:20,372 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 64 transitions, 345 flow [2021-03-11 20:11:20,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 20:11:20,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 20:11:20,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 700 transitions. [2021-03-11 20:11:20,374 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8177570093457944 [2021-03-11 20:11:20,374 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 700 transitions. [2021-03-11 20:11:20,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 700 transitions. [2021-03-11 20:11:20,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:20,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 700 transitions. [2021-03-11 20:11:20,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:20,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:20,378 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:20,378 INFO L185 Difference]: Start difference. First operand has 68 places, 62 transitions, 325 flow. Second operand 4 states and 700 transitions. [2021-03-11 20:11:20,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 64 transitions, 345 flow [2021-03-11 20:11:20,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 64 transitions, 342 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-11 20:11:20,460 INFO L241 Difference]: Finished difference. Result has 70 places, 63 transitions, 336 flow [2021-03-11 20:11:20,460 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=336, PETRI_PLACES=70, PETRI_TRANSITIONS=63} [2021-03-11 20:11:20,461 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places. [2021-03-11 20:11:20,461 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 63 transitions, 336 flow [2021-03-11 20:11:20,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 174.25) internal successors, (697), 4 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:20,461 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:20,461 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] [2021-03-11 20:11:20,461 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 20:11:20,462 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:20,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:20,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1070607414, now seen corresponding path program 3 times [2021-03-11 20:11:20,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:20,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283796575] [2021-03-11 20:11:20,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:20,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:20,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:11:20,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:20,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:20,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:20,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:20,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:20,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:11:20,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:11:20,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283796575] [2021-03-11 20:11:20,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:20,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:11:20,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659375865] [2021-03-11 20:11:20,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:11:20,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:20,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:11:20,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:11:20,555 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 214 [2021-03-11 20:11:20,556 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 63 transitions, 336 flow. Second operand has 5 states, 5 states have (on average 169.0) internal successors, (845), 5 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:20,556 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:20,556 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 214 [2021-03-11 20:11:20,556 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:20,856 INFO L129 PetriNetUnfolder]: 1171/2684 cut-off events. [2021-03-11 20:11:20,856 INFO L130 PetriNetUnfolder]: For 3798/4002 co-relation queries the response was YES. [2021-03-11 20:11:20,874 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8889 conditions, 2684 events. 1171/2684 cut-off events. For 3798/4002 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 24758 event pairs, 119 based on Foata normal form. 2/2387 useless extension candidates. Maximal degree in co-relation 8868. Up to 740 conditions per place. [2021-03-11 20:11:20,879 INFO L132 encePairwiseOnDemand]: 210/214 looper letters, 4 selfloop transitions, 1 changer transitions 3/65 dead transitions. [2021-03-11 20:11:20,879 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 65 transitions, 358 flow [2021-03-11 20:11:20,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:11:20,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:11:20,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 848 transitions. [2021-03-11 20:11:20,882 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7925233644859813 [2021-03-11 20:11:20,882 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 848 transitions. [2021-03-11 20:11:20,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 848 transitions. [2021-03-11 20:11:20,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:20,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 848 transitions. [2021-03-11 20:11:20,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 169.6) internal successors, (848), 5 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:20,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:20,887 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:20,887 INFO L185 Difference]: Start difference. First operand has 70 places, 63 transitions, 336 flow. Second operand 5 states and 848 transitions. [2021-03-11 20:11:20,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 65 transitions, 358 flow [2021-03-11 20:11:21,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 65 transitions, 354 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-11 20:11:21,105 INFO L241 Difference]: Finished difference. Result has 74 places, 62 transitions, 337 flow [2021-03-11 20:11:21,105 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=337, PETRI_PLACES=74, PETRI_TRANSITIONS=62} [2021-03-11 20:11:21,105 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 30 predicate places. [2021-03-11 20:11:21,106 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 337 flow [2021-03-11 20:11:21,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 169.0) internal successors, (845), 5 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:21,106 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:21,106 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] [2021-03-11 20:11:21,106 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 20:11:21,106 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:21,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:21,107 INFO L82 PathProgramCache]: Analyzing trace with hash 24329494, now seen corresponding path program 4 times [2021-03-11 20:11:21,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:21,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027406781] [2021-03-11 20:11:21,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:21,242 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-03-11 20:11:21,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-11 20:11:21,280 INFO L142 QuantifierPusher]: treesize reduction 10, result has 85.7 percent of original size [2021-03-11 20:11:21,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-03-11 20:11:21,351 INFO L142 QuantifierPusher]: treesize reduction 54, result has 70.0 percent of original size [2021-03-11 20:11:21,356 INFO L147 QuantifierPusher]: treesize reduction 8, result has 93.7 percent of original size 118 [2021-03-11 20:11:21,416 INFO L142 QuantifierPusher]: treesize reduction 54, result has 70.7 percent of original size [2021-03-11 20:11:21,418 INFO L147 QuantifierPusher]: treesize reduction 8, result has 93.8 percent of original size 122 [2021-03-11 20:11:21,490 INFO L142 QuantifierPusher]: treesize reduction 11, result has 89.1 percent of original size [2021-03-11 20:11:21,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 90 [2021-03-11 20:11:21,508 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.3 percent of original size [2021-03-11 20:11:21,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-03-11 20:11:21,562 INFO L142 QuantifierPusher]: treesize reduction 11, result has 87.9 percent of original size [2021-03-11 20:11:21,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 80 [2021-03-11 20:11:21,607 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.1 percent of original size [2021-03-11 20:11:21,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-11 20:11:21,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:21,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:11:21,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:11:21,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027406781] [2021-03-11 20:11:21,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:21,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-11 20:11:21,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85676084] [2021-03-11 20:11:21,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-11 20:11:21,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:21,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-11 20:11:21,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-11 20:11:21,655 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 214 [2021-03-11 20:11:21,656 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 337 flow. Second operand has 10 states, 10 states have (on average 143.0) internal successors, (1430), 10 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:21,656 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:21,656 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 214 [2021-03-11 20:11:21,656 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:22,117 INFO L129 PetriNetUnfolder]: 839/2009 cut-off events. [2021-03-11 20:11:22,117 INFO L130 PetriNetUnfolder]: For 4249/5276 co-relation queries the response was YES. [2021-03-11 20:11:22,129 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6934 conditions, 2009 events. 839/2009 cut-off events. For 4249/5276 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 17515 event pairs, 26 based on Foata normal form. 158/1994 useless extension candidates. Maximal degree in co-relation 6908. Up to 555 conditions per place. [2021-03-11 20:11:22,133 INFO L132 encePairwiseOnDemand]: 205/214 looper letters, 17 selfloop transitions, 6 changer transitions 16/86 dead transitions. [2021-03-11 20:11:22,134 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 86 transitions, 531 flow [2021-03-11 20:11:22,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 20:11:22,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-11 20:11:22,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1171 transitions. [2021-03-11 20:11:22,136 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6839953271028038 [2021-03-11 20:11:22,137 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1171 transitions. [2021-03-11 20:11:22,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1171 transitions. [2021-03-11 20:11:22,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:22,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1171 transitions. [2021-03-11 20:11:22,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 146.375) internal successors, (1171), 8 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:22,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 214.0) internal successors, (1926), 9 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:22,155 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 214.0) internal successors, (1926), 9 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:22,156 INFO L185 Difference]: Start difference. First operand has 74 places, 62 transitions, 337 flow. Second operand 8 states and 1171 transitions. [2021-03-11 20:11:22,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 86 transitions, 531 flow [2021-03-11 20:11:22,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 86 transitions, 512 flow, removed 8 selfloop flow, removed 4 redundant places. [2021-03-11 20:11:22,268 INFO L241 Difference]: Finished difference. Result has 81 places, 63 transitions, 369 flow [2021-03-11 20:11:22,269 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=369, PETRI_PLACES=81, PETRI_TRANSITIONS=63} [2021-03-11 20:11:22,269 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2021-03-11 20:11:22,269 INFO L480 AbstractCegarLoop]: Abstraction has has 81 places, 63 transitions, 369 flow [2021-03-11 20:11:22,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 143.0) internal successors, (1430), 10 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:22,269 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:22,270 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] [2021-03-11 20:11:22,270 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 20:11:22,270 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:22,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:22,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1629959864, now seen corresponding path program 5 times [2021-03-11 20:11:22,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:22,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022935011] [2021-03-11 20:11:22,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:11:22,328 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:11:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:11:22,372 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:11:22,415 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 20:11:22,416 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 20:11:22,416 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-11 20:11:22,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:11:22 BasicIcfg [2021-03-11 20:11:22,525 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 20:11:22,526 INFO L168 Benchmark]: Toolchain (without parser) took 18223.21 ms. Allocated memory was 255.9 MB in the beginning and 778.0 MB in the end (delta: 522.2 MB). Free memory was 233.4 MB in the beginning and 580.4 MB in the end (delta: -347.0 MB). Peak memory consumption was 173.8 MB. Max. memory is 16.0 GB. [2021-03-11 20:11:22,526 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 20:11:22,527 INFO L168 Benchmark]: CACSL2BoogieTranslator took 581.73 ms. Allocated memory was 255.9 MB in the beginning and 358.6 MB in the end (delta: 102.8 MB). Free memory was 232.6 MB in the beginning and 317.8 MB in the end (delta: -85.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-11 20:11:22,527 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.89 ms. Allocated memory is still 358.6 MB. Free memory was 317.8 MB in the beginning and 314.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:11:22,527 INFO L168 Benchmark]: Boogie Preprocessor took 61.34 ms. Allocated memory is still 358.6 MB. Free memory was 314.9 MB in the beginning and 312.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:11:22,531 INFO L168 Benchmark]: RCFGBuilder took 1973.05 ms. Allocated memory is still 358.6 MB. Free memory was 312.3 MB in the beginning and 226.0 MB in the end (delta: 86.3 MB). Peak memory consumption was 87.7 MB. Max. memory is 16.0 GB. [2021-03-11 20:11:22,535 INFO L168 Benchmark]: TraceAbstraction took 15517.22 ms. Allocated memory was 358.6 MB in the beginning and 778.0 MB in the end (delta: 419.4 MB). Free memory was 225.0 MB in the beginning and 580.4 MB in the end (delta: -355.5 MB). Peak memory consumption was 64.0 MB. Max. memory is 16.0 GB. [2021-03-11 20:11:22,539 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 581.73 ms. Allocated memory was 255.9 MB in the beginning and 358.6 MB in the end (delta: 102.8 MB). Free memory was 232.6 MB in the beginning and 317.8 MB in the end (delta: -85.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 81.89 ms. Allocated memory is still 358.6 MB. Free memory was 317.8 MB in the beginning and 314.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 61.34 ms. Allocated memory is still 358.6 MB. Free memory was 314.9 MB in the beginning and 312.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1973.05 ms. Allocated memory is still 358.6 MB. Free memory was 312.3 MB in the beginning and 226.0 MB in the end (delta: 86.3 MB). Peak memory consumption was 87.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 15517.22 ms. Allocated memory was 358.6 MB in the beginning and 778.0 MB in the end (delta: 419.4 MB). Free memory was 225.0 MB in the beginning and 580.4 MB in the end (delta: -355.5 MB). Peak memory consumption was 64.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9824.9ms, 126 PlacesBefore, 44 PlacesAfterwards, 115 TransitionsBefore, 32 TransitionsAfterwards, 2868 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, 8567 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3460, positive: 3230, positive conditional: 0, positive unconditional: 3230, negative: 230, negative conditional: 0, negative unconditional: 230, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1996, positive: 1924, positive conditional: 0, positive unconditional: 1924, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1996, positive: 1891, positive conditional: 0, positive unconditional: 1891, negative: 105, negative conditional: 0, negative unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 105, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1279, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 1220, negative conditional: 0, negative unconditional: 1220, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3460, positive: 1306, positive conditional: 0, positive unconditional: 1306, negative: 158, negative conditional: 0, negative unconditional: 158, unknown: 1996, unknown conditional: 0, unknown unconditional: 1996] , Statistics on independence cache: Total cache size (in pairs): 266, Positive cache size: 231, Positive conditional cache size: 0, Positive unconditional cache size: 231, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1185; [L857] FCALL, FORK 0 pthread_create(&t1185, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L858] 0 pthread_t t1186; [L859] FCALL, FORK 0 pthread_create(&t1186, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t1187; [L861] FCALL, FORK 0 pthread_create(&t1187, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t1188; [L863] FCALL, FORK 0 pthread_create(&t1188, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L822] 4 z = 2 [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L834] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L834] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L834] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L834] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L835] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L835] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L836] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L837] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L837] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L838] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L869] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L869] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L869] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L869] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L870] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L871] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L872] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L873] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L876] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L877] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L878] 0 x$flush_delayed = weak$$choice2 [L879] 0 x$mem_tmp = x [L880] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L880] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L881] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L881] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L881] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L881] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L882] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L882] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L882] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L882] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L883] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L883] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L883] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L883] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L884] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L884] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L885] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L885] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L885] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L886] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L886] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L888] 0 x = x$flush_delayed ? x$mem_tmp : x [L889] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 15272.3ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3110.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9897.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 52 SDtfs, 52 SDslu, 62 SDs, 0 SdLazy, 425 SolverSat, 127 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 497.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 721.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=444occurred in iteration=7, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 60.8ms SsaConstructionTime, 617.3ms SatisfiabilityAnalysisTime, 1268.7ms InterpolantComputationTime, 272 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 1990 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...