/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/mix042_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-24 19:39:49,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-24 19:39:49,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-24 19:39:49,994 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-24 19:39:49,994 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-24 19:39:49,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-24 19:39:49,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-24 19:39:49,998 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-24 19:39:50,001 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-24 19:39:50,005 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-24 19:39:50,006 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-24 19:39:50,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-24 19:39:50,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-24 19:39:50,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-24 19:39:50,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-24 19:39:50,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-24 19:39:50,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-24 19:39:50,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-24 19:39:50,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-24 19:39:50,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-24 19:39:50,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-24 19:39:50,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-24 19:39:50,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-24 19:39:50,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-24 19:39:50,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-24 19:39:50,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-24 19:39:50,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-24 19:39:50,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-24 19:39:50,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-24 19:39:50,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-24 19:39:50,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-24 19:39:50,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-24 19:39:50,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-24 19:39:50,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-24 19:39:50,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-24 19:39:50,052 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-24 19:39:50,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-24 19:39:50,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-24 19:39:50,053 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-24 19:39:50,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-24 19:39:50,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-24 19:39:50,058 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-24 19:39:50,091 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-24 19:39:50,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-24 19:39:50,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-24 19:39:50,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-24 19:39:50,095 INFO L138 SettingsManager]: * Use SBE=true [2021-03-24 19:39:50,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-24 19:39:50,096 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-24 19:39:50,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-24 19:39:50,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-24 19:39:50,096 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-24 19:39:50,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-24 19:39:50,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-24 19:39:50,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-24 19:39:50,098 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-24 19:39:50,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-24 19:39:50,098 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-24 19:39:50,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-24 19:39:50,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-24 19:39:50,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-24 19:39:50,099 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-24 19:39:50,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-24 19:39:50,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-24 19:39:50,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-24 19:39:50,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-24 19:39:50,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-24 19:39:50,100 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-24 19:39:50,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-24 19:39:50,100 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-24 19:39:50,100 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-24 19:39:50,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-24 19:39:50,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-24 19:39:50,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-24 19:39:50,449 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-24 19:39:50,450 INFO L275 PluginConnector]: CDTParser initialized [2021-03-24 19:39:50,451 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_pso.opt.i [2021-03-24 19:39:50,515 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49b23616d/9027a6be0e344f9ea61139ea3a140150/FLAG07ba64e39 [2021-03-24 19:39:50,978 INFO L306 CDTParser]: Found 1 translation units. [2021-03-24 19:39:50,983 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_pso.opt.i [2021-03-24 19:39:51,008 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49b23616d/9027a6be0e344f9ea61139ea3a140150/FLAG07ba64e39 [2021-03-24 19:39:51,323 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49b23616d/9027a6be0e344f9ea61139ea3a140150 [2021-03-24 19:39:51,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-24 19:39:51,326 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-24 19:39:51,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-24 19:39:51,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-24 19:39:51,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-24 19:39:51,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.03 07:39:51" (1/1) ... [2021-03-24 19:39:51,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@177be27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:39:51, skipping insertion in model container [2021-03-24 19:39:51,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.03 07:39:51" (1/1) ... [2021-03-24 19:39:51,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-24 19:39:51,392 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-24 19:39:51,530 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/mix042_pso.opt.i[948,961] [2021-03-24 19:39:51,750 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-24 19:39:51,756 INFO L203 MainTranslator]: Completed pre-run [2021-03-24 19:39:51,768 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/mix042_pso.opt.i[948,961] [2021-03-24 19:39:51,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-24 19:39:51,914 INFO L208 MainTranslator]: Completed translation [2021-03-24 19:39:51,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:39:51 WrapperNode [2021-03-24 19:39:51,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-24 19:39:51,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-24 19:39:51,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-24 19:39:51,916 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-24 19:39:51,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:39:51" (1/1) ... [2021-03-24 19:39:51,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:39:51" (1/1) ... [2021-03-24 19:39:51,995 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-24 19:39:51,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-24 19:39:51,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-24 19:39:51,996 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-24 19:39:52,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:39:51" (1/1) ... [2021-03-24 19:39:52,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:39:51" (1/1) ... [2021-03-24 19:39:52,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:39:51" (1/1) ... [2021-03-24 19:39:52,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:39:51" (1/1) ... [2021-03-24 19:39:52,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:39:51" (1/1) ... [2021-03-24 19:39:52,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:39:51" (1/1) ... [2021-03-24 19:39:52,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:39:51" (1/1) ... [2021-03-24 19:39:52,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-24 19:39:52,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-24 19:39:52,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-24 19:39:52,037 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-24 19:39:52,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:39:51" (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-24 19:39:52,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-24 19:39:52,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-24 19:39:52,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-24 19:39:52,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-24 19:39:52,136 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-24 19:39:52,136 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-24 19:39:52,137 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-24 19:39:52,137 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-24 19:39:52,138 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-24 19:39:52,138 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-24 19:39:52,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-24 19:39:52,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-24 19:39:52,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-24 19:39:52,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-24 19:39:52,140 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-24 19:39:53,856 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-24 19:39:53,856 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-24 19:39:53,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.03 07:39:53 BoogieIcfgContainer [2021-03-24 19:39:53,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-24 19:39:53,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-24 19:39:53,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-24 19:39:53,862 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-24 19:39:53,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.03 07:39:51" (1/3) ... [2021-03-24 19:39:53,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb0615a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.03 07:39:53, skipping insertion in model container [2021-03-24 19:39:53,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:39:51" (2/3) ... [2021-03-24 19:39:53,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb0615a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.03 07:39:53, skipping insertion in model container [2021-03-24 19:39:53,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.03 07:39:53" (3/3) ... [2021-03-24 19:39:53,865 INFO L111 eAbstractionObserver]: Analyzing ICFG mix042_pso.opt.i [2021-03-24 19:39:53,873 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-24 19:39:53,877 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-24 19:39:53,878 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-24 19:39:53,918 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,918 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,918 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,918 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,918 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,918 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,919 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,919 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,919 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,919 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,920 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,920 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,920 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,920 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,920 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,920 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,923 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,925 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,925 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,925 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,926 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,926 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,926 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,926 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,927 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,927 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,927 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,927 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,927 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,928 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,933 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,934 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,936 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,936 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,938 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,939 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,939 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,939 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,940 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,941 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:53,944 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-24 19:39:53,960 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-24 19:39:53,989 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-24 19:39:53,992 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-24 19:39:53,992 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-24 19:39:53,992 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-24 19:39:53,992 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-24 19:39:53,997 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-24 19:39:53,997 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-24 19:39:53,997 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-24 19:39:54,007 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 217 flow [2021-03-24 19:39:54,061 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2021-03-24 19:39:54,061 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 19:39:54,071 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-24 19:39:54,071 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 101 transitions, 217 flow [2021-03-24 19:39:54,084 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 98 transitions, 205 flow [2021-03-24 19:39:54,086 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-24 19:39:54,097 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 98 transitions, 205 flow [2021-03-24 19:39:54,099 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 98 transitions, 205 flow [2021-03-24 19:39:54,103 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 205 flow [2021-03-24 19:39:54,132 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2021-03-24 19:39:54,132 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 19:39:54,134 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-24 19:39:54,137 INFO L142 LiptonReduction]: Number of co-enabled transitions 1738 [2021-03-24 19:39:55,372 WARN L205 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-24 19:39:55,707 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-24 19:39:57,188 WARN L205 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-24 19:39:57,831 WARN L205 SmtUtils]: Spent 641.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-24 19:39:58,815 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-24 19:39:59,231 WARN L205 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-24 19:39:59,368 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-24 19:40:01,120 WARN L205 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 187 [2021-03-24 19:40:01,396 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-24 19:40:02,146 WARN L205 SmtUtils]: Spent 747.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-24 19:40:02,811 WARN L205 SmtUtils]: Spent 663.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-24 19:40:02,907 INFO L154 LiptonReduction]: Checked pairs total: 2986 [2021-03-24 19:40:02,907 INFO L156 LiptonReduction]: Total number of compositions: 67 [2021-03-24 19:40:02,909 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8824 [2021-03-24 19:40:02,918 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-24 19:40:02,918 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 19:40:02,918 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:02,919 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 19:40:02,919 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:02,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:02,923 INFO L82 PathProgramCache]: Analyzing trace with hash 684331068, now seen corresponding path program 1 times [2021-03-24 19:40:02,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:02,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579331711] [2021-03-24 19:40:02,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:40:03,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:03,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:03,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:03,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:03,163 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-24 19:40:03,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579331711] [2021-03-24 19:40:03,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:40:03,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-24 19:40:03,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832156665] [2021-03-24 19:40:03,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-24 19:40:03,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:40:03,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-24 19:40:03,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-24 19:40:03,182 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 168 [2021-03-24 19:40:03,184 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 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-24 19:40:03,184 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:40:03,184 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 168 [2021-03-24 19:40:03,185 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:40:03,243 INFO L129 PetriNetUnfolder]: 23/100 cut-off events. [2021-03-24 19:40:03,244 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 19:40:03,244 INFO L84 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 100 events. 23/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 325 event pairs, 9 based on Foata normal form. 5/98 useless extension candidates. Maximal degree in co-relation 139. Up to 37 conditions per place. [2021-03-24 19:40:03,245 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 7 selfloop transitions, 2 changer transitions 5/40 dead transitions. [2021-03-24 19:40:03,246 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 40 transitions, 111 flow [2021-03-24 19:40:03,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-24 19:40:03,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-24 19:40:03,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2021-03-24 19:40:03,258 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9027777777777778 [2021-03-24 19:40:03,259 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2021-03-24 19:40:03,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2021-03-24 19:40:03,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:40:03,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2021-03-24 19:40:03,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 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-24 19:40:03,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 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-24 19:40:03,273 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 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-24 19:40:03,275 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 455 transitions. [2021-03-24 19:40:03,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 40 transitions, 111 flow [2021-03-24 19:40:03,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 108 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-24 19:40:03,279 INFO L241 Difference]: Finished difference. Result has 45 places, 32 transitions, 74 flow [2021-03-24 19:40:03,280 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2021-03-24 19:40:03,281 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2021-03-24 19:40:03,281 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 74 flow [2021-03-24 19:40:03,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 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-24 19:40:03,281 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:03,281 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 19:40:03,282 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-24 19:40:03,282 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:03,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:03,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1683336467, now seen corresponding path program 1 times [2021-03-24 19:40:03,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:03,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603647830] [2021-03-24 19:40:03,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:40:03,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:03,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:03,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:03,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:03,380 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 19:40:03,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 19:40:03,385 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-24 19:40:03,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603647830] [2021-03-24 19:40:03,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:40:03,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-24 19:40:03,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716435772] [2021-03-24 19:40:03,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-24 19:40:03,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:40:03,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-24 19:40:03,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-24 19:40:03,388 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 168 [2021-03-24 19:40:03,389 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 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-24 19:40:03,389 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:40:03,389 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 168 [2021-03-24 19:40:03,389 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:40:03,416 INFO L129 PetriNetUnfolder]: 0/37 cut-off events. [2021-03-24 19:40:03,416 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 19:40:03,416 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 35 event pairs, 0 based on Foata normal form. 2/39 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-24 19:40:03,416 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 2 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2021-03-24 19:40:03,416 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 34 transitions, 90 flow [2021-03-24 19:40:03,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 19:40:03,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 19:40:03,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 753 transitions. [2021-03-24 19:40:03,420 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8964285714285715 [2021-03-24 19:40:03,420 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 753 transitions. [2021-03-24 19:40:03,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 753 transitions. [2021-03-24 19:40:03,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:40:03,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 753 transitions. [2021-03-24 19:40:03,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 150.6) internal successors, (753), 5 states have internal predecessors, (753), 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-24 19:40:03,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 168.0) internal successors, (1008), 6 states have internal predecessors, (1008), 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-24 19:40:03,426 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 168.0) internal successors, (1008), 6 states have internal predecessors, (1008), 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-24 19:40:03,426 INFO L185 Difference]: Start difference. First operand has 45 places, 32 transitions, 74 flow. Second operand 5 states and 753 transitions. [2021-03-24 19:40:03,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 34 transitions, 90 flow [2021-03-24 19:40:03,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 34 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-24 19:40:03,428 INFO L241 Difference]: Finished difference. Result has 46 places, 32 transitions, 82 flow [2021-03-24 19:40:03,428 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2021-03-24 19:40:03,428 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2021-03-24 19:40:03,428 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 82 flow [2021-03-24 19:40:03,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 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-24 19:40:03,429 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:03,429 INFO L263 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] [2021-03-24 19:40:03,429 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-24 19:40:03,429 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:03,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:03,430 INFO L82 PathProgramCache]: Analyzing trace with hash 593688495, now seen corresponding path program 1 times [2021-03-24 19:40:03,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:03,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528979736] [2021-03-24 19:40:03,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:40:03,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:03,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:03,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:03,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:03,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:03,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:40:03,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:03,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 19:40:03,554 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-24 19:40:03,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-24 19:40:03,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:03,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 19:40:03,594 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 19:40:03,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 19:40:03,601 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-24 19:40:03,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528979736] [2021-03-24 19:40:03,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:40:03,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-24 19:40:03,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455988211] [2021-03-24 19:40:03,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-24 19:40:03,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:40:03,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-24 19:40:03,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-03-24 19:40:03,606 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 168 [2021-03-24 19:40:03,607 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 82 flow. Second operand has 8 states, 8 states have (on average 130.0) internal successors, (1040), 8 states have internal predecessors, (1040), 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-24 19:40:03,607 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:40:03,607 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 168 [2021-03-24 19:40:03,607 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:40:03,754 INFO L129 PetriNetUnfolder]: 28/104 cut-off events. [2021-03-24 19:40:03,754 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-03-24 19:40:03,755 INFO L84 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 104 events. 28/104 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 350 event pairs, 13 based on Foata normal form. 6/109 useless extension candidates. Maximal degree in co-relation 184. Up to 50 conditions per place. [2021-03-24 19:40:03,756 INFO L132 encePairwiseOnDemand]: 159/168 looper letters, 9 selfloop transitions, 8 changer transitions 6/44 dead transitions. [2021-03-24 19:40:03,756 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 44 transitions, 154 flow [2021-03-24 19:40:03,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-24 19:40:03,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-24 19:40:03,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1186 transitions. [2021-03-24 19:40:03,760 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7843915343915344 [2021-03-24 19:40:03,760 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1186 transitions. [2021-03-24 19:40:03,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1186 transitions. [2021-03-24 19:40:03,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:40:03,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1186 transitions. [2021-03-24 19:40:03,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 131.77777777777777) internal successors, (1186), 9 states have internal predecessors, (1186), 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-24 19:40:03,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 168.0) internal successors, (1680), 10 states have internal predecessors, (1680), 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-24 19:40:03,767 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 168.0) internal successors, (1680), 10 states have internal predecessors, (1680), 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-24 19:40:03,767 INFO L185 Difference]: Start difference. First operand has 46 places, 32 transitions, 82 flow. Second operand 9 states and 1186 transitions. [2021-03-24 19:40:03,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 44 transitions, 154 flow [2021-03-24 19:40:03,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 146 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-24 19:40:03,770 INFO L241 Difference]: Finished difference. Result has 52 places, 36 transitions, 118 flow [2021-03-24 19:40:03,770 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=118, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2021-03-24 19:40:03,770 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2021-03-24 19:40:03,770 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 118 flow [2021-03-24 19:40:03,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 130.0) internal successors, (1040), 8 states have internal predecessors, (1040), 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-24 19:40:03,771 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:03,771 INFO L263 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] [2021-03-24 19:40:03,771 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-24 19:40:03,771 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:03,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:03,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1654357462, now seen corresponding path program 1 times [2021-03-24 19:40:03,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:03,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280889760] [2021-03-24 19:40:03,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:40:03,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:03,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:03,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:03,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:03,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:03,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:03,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:03,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:40:03,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:03,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 19:40:03,938 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 19:40:03,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 19:40:03,944 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-24 19:40:03,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280889760] [2021-03-24 19:40:03,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:40:03,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-24 19:40:03,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816751976] [2021-03-24 19:40:03,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-24 19:40:03,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:40:03,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-24 19:40:03,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-24 19:40:03,948 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 168 [2021-03-24 19:40:03,949 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 118 flow. Second operand has 6 states, 6 states have (on average 137.33333333333334) internal successors, (824), 6 states have internal predecessors, (824), 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-24 19:40:03,949 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:40:03,949 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 168 [2021-03-24 19:40:03,949 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:40:04,071 INFO L129 PetriNetUnfolder]: 36/121 cut-off events. [2021-03-24 19:40:04,071 INFO L130 PetriNetUnfolder]: For 82/88 co-relation queries the response was YES. [2021-03-24 19:40:04,073 INFO L84 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 121 events. 36/121 cut-off events. For 82/88 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 437 event pairs, 8 based on Foata normal form. 10/129 useless extension candidates. Maximal degree in co-relation 275. Up to 60 conditions per place. [2021-03-24 19:40:04,074 INFO L132 encePairwiseOnDemand]: 160/168 looper letters, 12 selfloop transitions, 11 changer transitions 5/50 dead transitions. [2021-03-24 19:40:04,074 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 232 flow [2021-03-24 19:40:04,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 19:40:04,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 19:40:04,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 978 transitions. [2021-03-24 19:40:04,077 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8316326530612245 [2021-03-24 19:40:04,077 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 978 transitions. [2021-03-24 19:40:04,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 978 transitions. [2021-03-24 19:40:04,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:40:04,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 978 transitions. [2021-03-24 19:40:04,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.71428571428572) internal successors, (978), 7 states have internal predecessors, (978), 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-24 19:40:04,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 168.0) internal successors, (1344), 8 states have internal predecessors, (1344), 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-24 19:40:04,084 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 168.0) internal successors, (1344), 8 states have internal predecessors, (1344), 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-24 19:40:04,085 INFO L185 Difference]: Start difference. First operand has 52 places, 36 transitions, 118 flow. Second operand 7 states and 978 transitions. [2021-03-24 19:40:04,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 232 flow [2021-03-24 19:40:04,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 222 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-24 19:40:04,089 INFO L241 Difference]: Finished difference. Result has 56 places, 43 transitions, 187 flow [2021-03-24 19:40:04,090 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=187, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2021-03-24 19:40:04,090 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2021-03-24 19:40:04,090 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 187 flow [2021-03-24 19:40:04,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 137.33333333333334) internal successors, (824), 6 states have internal predecessors, (824), 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-24 19:40:04,090 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:04,091 INFO L263 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] [2021-03-24 19:40:04,091 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-24 19:40:04,091 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:04,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:04,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1389204000, now seen corresponding path program 2 times [2021-03-24 19:40:04,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:04,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581611920] [2021-03-24 19:40:04,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:40:04,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:04,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:04,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:04,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:04,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:04,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 19:40:04,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:04,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-24 19:40:04,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:04,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:40:04,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:04,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 19:40:04,255 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 19:40:04,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 19:40:04,260 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-24 19:40:04,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581611920] [2021-03-24 19:40:04,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:40:04,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-24 19:40:04,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999882847] [2021-03-24 19:40:04,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-24 19:40:04,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:40:04,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-24 19:40:04,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-03-24 19:40:04,264 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 168 [2021-03-24 19:40:04,265 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 187 flow. Second operand has 8 states, 8 states have (on average 130.125) internal successors, (1041), 8 states have internal predecessors, (1041), 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-24 19:40:04,265 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:40:04,265 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 168 [2021-03-24 19:40:04,268 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:40:04,407 INFO L129 PetriNetUnfolder]: 39/124 cut-off events. [2021-03-24 19:40:04,407 INFO L130 PetriNetUnfolder]: For 228/246 co-relation queries the response was YES. [2021-03-24 19:40:04,407 INFO L84 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 124 events. 39/124 cut-off events. For 228/246 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 440 event pairs, 1 based on Foata normal form. 17/141 useless extension candidates. Maximal degree in co-relation 400. Up to 55 conditions per place. [2021-03-24 19:40:04,408 INFO L132 encePairwiseOnDemand]: 159/168 looper letters, 15 selfloop transitions, 16 changer transitions 5/57 dead transitions. [2021-03-24 19:40:04,408 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 57 transitions, 339 flow [2021-03-24 19:40:04,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-24 19:40:04,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-24 19:40:04,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1192 transitions. [2021-03-24 19:40:04,412 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7883597883597884 [2021-03-24 19:40:04,412 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1192 transitions. [2021-03-24 19:40:04,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1192 transitions. [2021-03-24 19:40:04,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:40:04,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1192 transitions. [2021-03-24 19:40:04,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 132.44444444444446) internal successors, (1192), 9 states have internal predecessors, (1192), 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-24 19:40:04,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 168.0) internal successors, (1680), 10 states have internal predecessors, (1680), 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-24 19:40:04,418 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 168.0) internal successors, (1680), 10 states have internal predecessors, (1680), 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-24 19:40:04,418 INFO L185 Difference]: Start difference. First operand has 56 places, 43 transitions, 187 flow. Second operand 9 states and 1192 transitions. [2021-03-24 19:40:04,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 57 transitions, 339 flow [2021-03-24 19:40:04,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 57 transitions, 320 flow, removed 9 selfloop flow, removed 3 redundant places. [2021-03-24 19:40:04,424 INFO L241 Difference]: Finished difference. Result has 63 places, 47 transitions, 256 flow [2021-03-24 19:40:04,424 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=256, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2021-03-24 19:40:04,424 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 15 predicate places. [2021-03-24 19:40:04,424 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 256 flow [2021-03-24 19:40:04,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 130.125) internal successors, (1041), 8 states have internal predecessors, (1041), 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-24 19:40:04,425 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:04,425 INFO L263 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] [2021-03-24 19:40:04,425 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-24 19:40:04,425 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:04,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:04,426 INFO L82 PathProgramCache]: Analyzing trace with hash -695529382, now seen corresponding path program 3 times [2021-03-24 19:40:04,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:04,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258288735] [2021-03-24 19:40:04,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:40:04,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:04,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:04,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:04,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:04,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:04,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:40:04,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:04,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:40:04,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:04,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 19:40:04,503 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 19:40:04,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 19:40:04,508 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-24 19:40:04,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258288735] [2021-03-24 19:40:04,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:40:04,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-24 19:40:04,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46670236] [2021-03-24 19:40:04,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-24 19:40:04,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:40:04,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-24 19:40:04,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-24 19:40:04,511 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 168 [2021-03-24 19:40:04,512 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 137.33333333333334) internal successors, (824), 6 states have internal predecessors, (824), 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-24 19:40:04,512 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:40:04,512 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 168 [2021-03-24 19:40:04,512 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:40:04,598 INFO L129 PetriNetUnfolder]: 35/125 cut-off events. [2021-03-24 19:40:04,598 INFO L130 PetriNetUnfolder]: For 408/440 co-relation queries the response was YES. [2021-03-24 19:40:04,601 INFO L84 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 125 events. 35/125 cut-off events. For 408/440 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 473 event pairs, 7 based on Foata normal form. 27/150 useless extension candidates. Maximal degree in co-relation 469. Up to 53 conditions per place. [2021-03-24 19:40:04,605 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 16 selfloop transitions, 14 changer transitions 6/58 dead transitions. [2021-03-24 19:40:04,606 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 58 transitions, 432 flow [2021-03-24 19:40:04,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 19:40:04,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 19:40:04,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 974 transitions. [2021-03-24 19:40:04,610 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8282312925170068 [2021-03-24 19:40:04,610 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 974 transitions. [2021-03-24 19:40:04,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 974 transitions. [2021-03-24 19:40:04,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:40:04,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 974 transitions. [2021-03-24 19:40:04,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.14285714285714) internal successors, (974), 7 states have internal predecessors, (974), 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-24 19:40:04,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 168.0) internal successors, (1344), 8 states have internal predecessors, (1344), 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-24 19:40:04,618 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 168.0) internal successors, (1344), 8 states have internal predecessors, (1344), 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-24 19:40:04,618 INFO L185 Difference]: Start difference. First operand has 63 places, 47 transitions, 256 flow. Second operand 7 states and 974 transitions. [2021-03-24 19:40:04,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 58 transitions, 432 flow [2021-03-24 19:40:04,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 58 transitions, 402 flow, removed 10 selfloop flow, removed 5 redundant places. [2021-03-24 19:40:04,625 INFO L241 Difference]: Finished difference. Result has 65 places, 49 transitions, 309 flow [2021-03-24 19:40:04,625 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=309, PETRI_PLACES=65, PETRI_TRANSITIONS=49} [2021-03-24 19:40:04,625 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 17 predicate places. [2021-03-24 19:40:04,625 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 49 transitions, 309 flow [2021-03-24 19:40:04,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 137.33333333333334) internal successors, (824), 6 states have internal predecessors, (824), 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-24 19:40:04,626 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:04,626 INFO L263 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] [2021-03-24 19:40:04,626 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-24 19:40:04,626 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:04,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:04,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1670615660, now seen corresponding path program 1 times [2021-03-24 19:40:04,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:04,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565589469] [2021-03-24 19:40:04,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:40:04,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:04,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:04,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:04,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:04,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:04,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:40:04,716 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 19:40:04,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:40:04,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:04,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:04,725 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-24 19:40:04,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565589469] [2021-03-24 19:40:04,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:40:04,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-24 19:40:04,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573870166] [2021-03-24 19:40:04,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 19:40:04,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:40:04,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 19:40:04,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-24 19:40:04,727 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 168 [2021-03-24 19:40:04,728 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 49 transitions, 309 flow. Second operand has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 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-24 19:40:04,728 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:40:04,728 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 168 [2021-03-24 19:40:04,728 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:40:04,834 INFO L129 PetriNetUnfolder]: 119/289 cut-off events. [2021-03-24 19:40:04,834 INFO L130 PetriNetUnfolder]: For 612/663 co-relation queries the response was YES. [2021-03-24 19:40:04,836 INFO L84 FinitePrefix]: Finished finitePrefix Result has 922 conditions, 289 events. 119/289 cut-off events. For 612/663 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1544 event pairs, 33 based on Foata normal form. 50/319 useless extension candidates. Maximal degree in co-relation 889. Up to 120 conditions per place. [2021-03-24 19:40:04,840 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 14 selfloop transitions, 13 changer transitions 0/67 dead transitions. [2021-03-24 19:40:04,840 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 399 flow [2021-03-24 19:40:04,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 19:40:04,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 19:40:04,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1007 transitions. [2021-03-24 19:40:04,844 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8562925170068028 [2021-03-24 19:40:04,844 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1007 transitions. [2021-03-24 19:40:04,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1007 transitions. [2021-03-24 19:40:04,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:40:04,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1007 transitions. [2021-03-24 19:40:04,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.85714285714286) internal successors, (1007), 7 states have internal predecessors, (1007), 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-24 19:40:04,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 168.0) internal successors, (1344), 8 states have internal predecessors, (1344), 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-24 19:40:04,848 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 168.0) internal successors, (1344), 8 states have internal predecessors, (1344), 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-24 19:40:04,848 INFO L185 Difference]: Start difference. First operand has 65 places, 49 transitions, 309 flow. Second operand 7 states and 1007 transitions. [2021-03-24 19:40:04,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 67 transitions, 399 flow [2021-03-24 19:40:04,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 67 transitions, 373 flow, removed 5 selfloop flow, removed 5 redundant places. [2021-03-24 19:40:04,853 INFO L241 Difference]: Finished difference. Result has 68 places, 61 transitions, 385 flow [2021-03-24 19:40:04,853 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=385, PETRI_PLACES=68, PETRI_TRANSITIONS=61} [2021-03-24 19:40:04,853 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 20 predicate places. [2021-03-24 19:40:04,853 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 385 flow [2021-03-24 19:40:04,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 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-24 19:40:04,854 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:04,854 INFO L263 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-24 19:40:04,854 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-24 19:40:04,854 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:04,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:04,855 INFO L82 PathProgramCache]: Analyzing trace with hash 856858438, now seen corresponding path program 1 times [2021-03-24 19:40:04,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:04,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813844187] [2021-03-24 19:40:04,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:40:04,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:04,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:04,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:04,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:04,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:04,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:04,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:04,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:40:04,945 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 19:40:04,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:40:04,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:04,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:04,955 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-24 19:40:04,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813844187] [2021-03-24 19:40:04,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:40:04,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-24 19:40:04,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481116113] [2021-03-24 19:40:04,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-24 19:40:04,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:40:04,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-24 19:40:04,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-24 19:40:04,957 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 168 [2021-03-24 19:40:04,958 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 385 flow. Second operand has 6 states, 6 states have (on average 140.83333333333334) internal successors, (845), 6 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-24 19:40:04,958 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:40:04,958 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 168 [2021-03-24 19:40:04,958 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:40:05,103 INFO L129 PetriNetUnfolder]: 82/224 cut-off events. [2021-03-24 19:40:05,104 INFO L130 PetriNetUnfolder]: For 826/1184 co-relation queries the response was YES. [2021-03-24 19:40:05,105 INFO L84 FinitePrefix]: Finished finitePrefix Result has 936 conditions, 224 events. 82/224 cut-off events. For 826/1184 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1065 event pairs, 4 based on Foata normal form. 118/328 useless extension candidates. Maximal degree in co-relation 902. Up to 105 conditions per place. [2021-03-24 19:40:05,106 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 7 selfloop transitions, 26 changer transitions 6/76 dead transitions. [2021-03-24 19:40:05,106 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 76 transitions, 559 flow [2021-03-24 19:40:05,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-24 19:40:05,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-24 19:40:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1438 transitions. [2021-03-24 19:40:05,111 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8559523809523809 [2021-03-24 19:40:05,111 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1438 transitions. [2021-03-24 19:40:05,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1438 transitions. [2021-03-24 19:40:05,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:40:05,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1438 transitions. [2021-03-24 19:40:05,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 143.8) internal successors, (1438), 10 states have internal predecessors, (1438), 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-24 19:40:05,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 168.0) internal successors, (1848), 11 states have internal predecessors, (1848), 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-24 19:40:05,118 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 168.0) internal successors, (1848), 11 states have internal predecessors, (1848), 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-24 19:40:05,119 INFO L185 Difference]: Start difference. First operand has 68 places, 61 transitions, 385 flow. Second operand 10 states and 1438 transitions. [2021-03-24 19:40:05,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 76 transitions, 559 flow [2021-03-24 19:40:05,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 76 transitions, 559 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-24 19:40:05,123 INFO L241 Difference]: Finished difference. Result has 80 places, 70 transitions, 523 flow [2021-03-24 19:40:05,123 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=523, PETRI_PLACES=80, PETRI_TRANSITIONS=70} [2021-03-24 19:40:05,124 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 32 predicate places. [2021-03-24 19:40:05,124 INFO L480 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 523 flow [2021-03-24 19:40:05,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 140.83333333333334) internal successors, (845), 6 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-24 19:40:05,124 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:05,124 INFO L263 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] [2021-03-24 19:40:05,124 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-24 19:40:05,125 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:05,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:05,125 INFO L82 PathProgramCache]: Analyzing trace with hash -803185025, now seen corresponding path program 1 times [2021-03-24 19:40:05,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:05,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565834418] [2021-03-24 19:40:05,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:40:05,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:05,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:05,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:05,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:05,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:05,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:05,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:05,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:05,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:05,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:40:05,216 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 19:40:05,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:40:05,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:05,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:05,226 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-24 19:40:05,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565834418] [2021-03-24 19:40:05,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:40:05,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-24 19:40:05,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798805651] [2021-03-24 19:40:05,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-24 19:40:05,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:40:05,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-24 19:40:05,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-24 19:40:05,229 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 168 [2021-03-24 19:40:05,230 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 523 flow. Second operand has 7 states, 7 states have (on average 140.85714285714286) internal successors, (986), 7 states have internal predecessors, (986), 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-24 19:40:05,230 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:40:05,230 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 168 [2021-03-24 19:40:05,230 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:40:05,420 INFO L129 PetriNetUnfolder]: 60/177 cut-off events. [2021-03-24 19:40:05,420 INFO L130 PetriNetUnfolder]: For 1315/2226 co-relation queries the response was YES. [2021-03-24 19:40:05,421 INFO L84 FinitePrefix]: Finished finitePrefix Result has 891 conditions, 177 events. 60/177 cut-off events. For 1315/2226 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 814 event pairs, 0 based on Foata normal form. 148/312 useless extension candidates. Maximal degree in co-relation 856. Up to 90 conditions per place. [2021-03-24 19:40:05,423 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 3 selfloop transitions, 31 changer transitions 7/77 dead transitions. [2021-03-24 19:40:05,423 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 77 transitions, 657 flow [2021-03-24 19:40:05,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-24 19:40:05,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-24 19:40:05,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1860 transitions. [2021-03-24 19:40:05,428 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8516483516483516 [2021-03-24 19:40:05,428 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1860 transitions. [2021-03-24 19:40:05,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1860 transitions. [2021-03-24 19:40:05,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:40:05,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1860 transitions. [2021-03-24 19:40:05,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 143.07692307692307) internal successors, (1860), 13 states have internal predecessors, (1860), 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-24 19:40:05,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 168.0) internal successors, (2352), 14 states have internal predecessors, (2352), 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-24 19:40:05,438 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 168.0) internal successors, (2352), 14 states have internal predecessors, (2352), 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-24 19:40:05,438 INFO L185 Difference]: Start difference. First operand has 80 places, 70 transitions, 523 flow. Second operand 13 states and 1860 transitions. [2021-03-24 19:40:05,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 77 transitions, 657 flow [2021-03-24 19:40:05,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 77 transitions, 526 flow, removed 51 selfloop flow, removed 8 redundant places. [2021-03-24 19:40:05,445 INFO L241 Difference]: Finished difference. Result has 89 places, 70 transitions, 484 flow [2021-03-24 19:40:05,445 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=484, PETRI_PLACES=89, PETRI_TRANSITIONS=70} [2021-03-24 19:40:05,445 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 41 predicate places. [2021-03-24 19:40:05,445 INFO L480 AbstractCegarLoop]: Abstraction has has 89 places, 70 transitions, 484 flow [2021-03-24 19:40:05,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 140.85714285714286) internal successors, (986), 7 states have internal predecessors, (986), 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-24 19:40:05,446 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:05,446 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 19:40:05,446 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-24 19:40:05,446 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:05,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:05,447 INFO L82 PathProgramCache]: Analyzing trace with hash 388413372, now seen corresponding path program 1 times [2021-03-24 19:40:05,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:05,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104502755] [2021-03-24 19:40:05,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:40:05,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:05,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:05,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:05,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:05,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:05,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:05,530 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 19:40:05,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 19:40:05,535 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-24 19:40:05,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104502755] [2021-03-24 19:40:05,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:40:05,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 19:40:05,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77974237] [2021-03-24 19:40:05,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 19:40:05,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:40:05,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 19:40:05,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-24 19:40:05,540 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 168 [2021-03-24 19:40:05,541 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 70 transitions, 484 flow. Second operand has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 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-24 19:40:05,541 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:40:05,541 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 168 [2021-03-24 19:40:05,541 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:40:05,604 INFO L129 PetriNetUnfolder]: 109/314 cut-off events. [2021-03-24 19:40:05,605 INFO L130 PetriNetUnfolder]: For 892/963 co-relation queries the response was YES. [2021-03-24 19:40:05,607 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1241 conditions, 314 events. 109/314 cut-off events. For 892/963 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 1885 event pairs, 0 based on Foata normal form. 9/302 useless extension candidates. Maximal degree in co-relation 1200. Up to 84 conditions per place. [2021-03-24 19:40:05,609 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 4 selfloop transitions, 2 changer transitions 1/72 dead transitions. [2021-03-24 19:40:05,609 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 72 transitions, 502 flow [2021-03-24 19:40:05,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 19:40:05,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 19:40:05,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 728 transitions. [2021-03-24 19:40:05,612 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2021-03-24 19:40:05,612 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 728 transitions. [2021-03-24 19:40:05,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 728 transitions. [2021-03-24 19:40:05,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:40:05,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 728 transitions. [2021-03-24 19:40:05,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.6) internal successors, (728), 5 states have internal predecessors, (728), 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-24 19:40:05,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 168.0) internal successors, (1008), 6 states have internal predecessors, (1008), 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-24 19:40:05,616 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 168.0) internal successors, (1008), 6 states have internal predecessors, (1008), 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-24 19:40:05,616 INFO L185 Difference]: Start difference. First operand has 89 places, 70 transitions, 484 flow. Second operand 5 states and 728 transitions. [2021-03-24 19:40:05,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 72 transitions, 502 flow [2021-03-24 19:40:05,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 72 transitions, 413 flow, removed 17 selfloop flow, removed 11 redundant places. [2021-03-24 19:40:05,631 INFO L241 Difference]: Finished difference. Result has 83 places, 71 transitions, 410 flow [2021-03-24 19:40:05,632 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=410, PETRI_PLACES=83, PETRI_TRANSITIONS=71} [2021-03-24 19:40:05,632 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 35 predicate places. [2021-03-24 19:40:05,632 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 71 transitions, 410 flow [2021-03-24 19:40:05,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 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-24 19:40:05,633 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:05,633 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 19:40:05,633 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-24 19:40:05,634 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:05,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:05,634 INFO L82 PathProgramCache]: Analyzing trace with hash 2075751602, now seen corresponding path program 2 times [2021-03-24 19:40:05,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:05,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218589096] [2021-03-24 19:40:05,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:40:05,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:05,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:05,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:05,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:05,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:05,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:05,700 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 19:40:05,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 19:40:05,707 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-24 19:40:05,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218589096] [2021-03-24 19:40:05,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:40:05,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 19:40:05,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401907851] [2021-03-24 19:40:05,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 19:40:05,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:40:05,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 19:40:05,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-24 19:40:05,710 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 168 [2021-03-24 19:40:05,711 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 71 transitions, 410 flow. Second operand has 5 states, 5 states have (on average 143.2) internal successors, (716), 5 states have internal predecessors, (716), 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-24 19:40:05,711 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:40:05,711 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 168 [2021-03-24 19:40:05,711 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:40:05,793 INFO L129 PetriNetUnfolder]: 206/563 cut-off events. [2021-03-24 19:40:05,793 INFO L130 PetriNetUnfolder]: For 865/911 co-relation queries the response was YES. [2021-03-24 19:40:05,797 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2014 conditions, 563 events. 206/563 cut-off events. For 865/911 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 4043 event pairs, 0 based on Foata normal form. 15/522 useless extension candidates. Maximal degree in co-relation 1990. Up to 161 conditions per place. [2021-03-24 19:40:05,798 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 5 selfloop transitions, 2 changer transitions 13/73 dead transitions. [2021-03-24 19:40:05,798 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 73 transitions, 432 flow [2021-03-24 19:40:05,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 19:40:05,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 19:40:05,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 719 transitions. [2021-03-24 19:40:05,800 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8559523809523809 [2021-03-24 19:40:05,800 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 719 transitions. [2021-03-24 19:40:05,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 719 transitions. [2021-03-24 19:40:05,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:40:05,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 719 transitions. [2021-03-24 19:40:05,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 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-24 19:40:05,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 168.0) internal successors, (1008), 6 states have internal predecessors, (1008), 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-24 19:40:05,804 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 168.0) internal successors, (1008), 6 states have internal predecessors, (1008), 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-24 19:40:05,804 INFO L185 Difference]: Start difference. First operand has 83 places, 71 transitions, 410 flow. Second operand 5 states and 719 transitions. [2021-03-24 19:40:05,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 73 transitions, 432 flow [2021-03-24 19:40:05,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 73 transitions, 429 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-24 19:40:05,816 INFO L241 Difference]: Finished difference. Result has 87 places, 60 transitions, 339 flow [2021-03-24 19:40:05,817 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=339, PETRI_PLACES=87, PETRI_TRANSITIONS=60} [2021-03-24 19:40:05,817 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 39 predicate places. [2021-03-24 19:40:05,817 INFO L480 AbstractCegarLoop]: Abstraction has has 87 places, 60 transitions, 339 flow [2021-03-24 19:40:05,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 143.2) internal successors, (716), 5 states have internal predecessors, (716), 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-24 19:40:05,817 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:05,817 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 19:40:05,818 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-24 19:40:05,818 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:05,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:05,818 INFO L82 PathProgramCache]: Analyzing trace with hash -2098594270, now seen corresponding path program 3 times [2021-03-24 19:40:05,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:05,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720590233] [2021-03-24 19:40:05,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-24 19:40:05,860 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-24 19:40:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-24 19:40:05,898 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-24 19:40:05,943 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-24 19:40:05,943 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-24 19:40:05,943 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-24 19:40:06,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.03 07:40:06 BasicIcfg [2021-03-24 19:40:06,048 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-24 19:40:06,049 INFO L168 Benchmark]: Toolchain (without parser) took 14722.38 ms. Allocated memory was 255.9 MB in the beginning and 490.7 MB in the end (delta: 234.9 MB). Free memory was 232.4 MB in the beginning and 289.0 MB in the end (delta: -56.7 MB). Peak memory consumption was 178.1 MB. Max. memory is 16.0 GB. [2021-03-24 19:40:06,049 INFO L168 Benchmark]: CDTParser took 0.11 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-24 19:40:06,049 INFO L168 Benchmark]: CACSL2BoogieTranslator took 585.94 ms. Allocated memory was 255.9 MB in the beginning and 339.7 MB in the end (delta: 83.9 MB). Free memory was 232.4 MB in the beginning and 298.9 MB in the end (delta: -66.5 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-24 19:40:06,050 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.26 ms. Allocated memory is still 339.7 MB. Free memory was 298.9 MB in the beginning and 296.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-24 19:40:06,050 INFO L168 Benchmark]: Boogie Preprocessor took 40.23 ms. Allocated memory is still 339.7 MB. Free memory was 296.2 MB in the beginning and 294.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-24 19:40:06,050 INFO L168 Benchmark]: RCFGBuilder took 1821.77 ms. Allocated memory is still 339.7 MB. Free memory was 294.0 MB in the beginning and 222.4 MB in the end (delta: 71.6 MB). Peak memory consumption was 74.3 MB. Max. memory is 16.0 GB. [2021-03-24 19:40:06,050 INFO L168 Benchmark]: TraceAbstraction took 12188.39 ms. Allocated memory was 339.7 MB in the beginning and 490.7 MB in the end (delta: 151.0 MB). Free memory was 221.4 MB in the beginning and 289.0 MB in the end (delta: -67.6 MB). Peak memory consumption was 84.4 MB. Max. memory is 16.0 GB. [2021-03-24 19:40:06,052 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.11 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 585.94 ms. Allocated memory was 255.9 MB in the beginning and 339.7 MB in the end (delta: 83.9 MB). Free memory was 232.4 MB in the beginning and 298.9 MB in the end (delta: -66.5 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 80.26 ms. Allocated memory is still 339.7 MB. Free memory was 298.9 MB in the beginning and 296.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 40.23 ms. Allocated memory is still 339.7 MB. Free memory was 296.2 MB in the beginning and 294.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1821.77 ms. Allocated memory is still 339.7 MB. Free memory was 294.0 MB in the beginning and 222.4 MB in the end (delta: 71.6 MB). Peak memory consumption was 74.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 12188.39 ms. Allocated memory was 339.7 MB in the beginning and 490.7 MB in the end (delta: 151.0 MB). Free memory was 221.4 MB in the beginning and 289.0 MB in the end (delta: -67.6 MB). Peak memory consumption was 84.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8807.9ms, 106 PlacesBefore, 48 PlacesAfterwards, 98 TransitionsBefore, 39 TransitionsAfterwards, 1738 CoEnabledTransitionPairs, 5 FixpointIterations, 29 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 67 TotalNumberOfCompositions, 2986 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1504, positive: 1420, positive conditional: 0, positive unconditional: 1420, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1101, positive: 1059, positive conditional: 0, positive unconditional: 1059, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1101, positive: 1059, positive conditional: 0, positive unconditional: 1059, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1101, positive: 1054, positive conditional: 0, positive unconditional: 1054, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 47, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 767, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 749, negative conditional: 0, negative unconditional: 749, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1504, positive: 361, positive conditional: 0, positive unconditional: 361, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 1101, unknown conditional: 0, unknown unconditional: 1101] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 122, Positive conditional cache size: 0, Positive unconditional cache size: 122, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1114; [L826] FCALL, FORK 0 pthread_create(&t1114, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1115; [L828] FCALL, FORK 0 pthread_create(&t1115, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L829] 0 pthread_t t1116; [L830] FCALL, FORK 0 pthread_create(&t1116, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 3 y$w_buff1 = y$w_buff0 [L783] 3 y$w_buff0 = 2 [L784] 3 y$w_buff1_used = y$w_buff0_used [L785] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L787] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L788] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L789] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L790] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L794] 3 z = 1 [L797] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L765] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L803] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L805] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L807] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L839] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L840] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 y$flush_delayed = weak$$choice2 [L846] 0 y$mem_tmp = y [L847] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L847] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L848] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L848] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L848] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L848] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L849] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L849] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L849] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L849] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L850] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L850] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L850] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L850] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L851] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L851] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L852] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L852] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L852] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L853] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L853] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L855] 0 y = y$flush_delayed ? y$mem_tmp : y [L856] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 100 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 11960.0ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1447.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8916.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 57 SDtfs, 82 SDslu, 73 SDs, 0 SdLazy, 321 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 362.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 515.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=523occurred in iteration=8, InterpolantAutomatonStates: 80, 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: 46.8ms SsaConstructionTime, 414.4ms SatisfiabilityAnalysisTime, 837.7ms InterpolantComputationTime, 303 NumberOfCodeBlocks, 303 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 970 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...