/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/mix003_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 19:57:58,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 19:57:58,833 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 19:57:58,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 19:57:58,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 19:57:58,858 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 19:57:58,860 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 19:57:58,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 19:57:58,863 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 19:57:58,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 19:57:58,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 19:57:58,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 19:57:58,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 19:57:58,867 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 19:57:58,868 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 19:57:58,869 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 19:57:58,870 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 19:57:58,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 19:57:58,872 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 19:57:58,874 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 19:57:58,875 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 19:57:58,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 19:57:58,884 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 19:57:58,886 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 19:57:58,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 19:57:58,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 19:57:58,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 19:57:58,893 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 19:57:58,893 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 19:57:58,894 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 19:57:58,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 19:57:58,895 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 19:57:58,895 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 19:57:58,896 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 19:57:58,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 19:57:58,897 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 19:57:58,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 19:57:58,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 19:57:58,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 19:57:58,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 19:57:58,906 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 19:57:58,910 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2021-03-11 19:57:58,945 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 19:57:58,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 19:57:58,948 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 19:57:58,948 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 19:57:58,949 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 19:57:58,949 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 19:57:58,949 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 19:57:58,949 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 19:57:58,949 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 19:57:58,949 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 19:57:58,950 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 19:57:58,950 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 19:57:58,950 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 19:57:58,950 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 19:57:58,951 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 19:57:58,951 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 19:57:58,951 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 19:57:58,951 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 19:57:58,951 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 19:57:58,951 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 19:57:58,951 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 19:57:58,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 19:57:58,952 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 19:57:58,952 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 19:57:58,952 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 19:57:58,952 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 19:57:58,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 19:57:58,952 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 19:57:58,953 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-11 19:57:59,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 19:57:59,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 19:57:59,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 19:57:59,284 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 19:57:59,284 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 19:57:59,285 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_rmo.oepc.i [2021-03-11 19:57:59,351 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e8aabb5/274a645165f14f85992c90fd352ddf7d/FLAGedfeca84a [2021-03-11 19:57:59,857 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 19:57:59,857 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_rmo.oepc.i [2021-03-11 19:57:59,873 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e8aabb5/274a645165f14f85992c90fd352ddf7d/FLAGedfeca84a [2021-03-11 19:58:00,173 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e8aabb5/274a645165f14f85992c90fd352ddf7d [2021-03-11 19:58:00,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 19:58:00,180 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 19:58:00,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 19:58:00,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 19:58:00,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 19:58:00,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 07:58:00" (1/1) ... [2021-03-11 19:58:00,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@659085d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:58:00, skipping insertion in model container [2021-03-11 19:58:00,199 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 07:58:00" (1/1) ... [2021-03-11 19:58:00,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 19:58:00,244 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 19:58:00,379 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/mix003_rmo.oepc.i[949,962] [2021-03-11 19:58:00,511 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 19:58:00,518 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 19:58:00,527 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/mix003_rmo.oepc.i[949,962] [2021-03-11 19:58:00,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 19:58:00,649 INFO L208 MainTranslator]: Completed translation [2021-03-11 19:58:00,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:58:00 WrapperNode [2021-03-11 19:58:00,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 19:58:00,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 19:58:00,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 19:58:00,651 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 19:58:00,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:58:00" (1/1) ... [2021-03-11 19:58:00,671 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:58:00" (1/1) ... [2021-03-11 19:58:00,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 19:58:00,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 19:58:00,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 19:58:00,707 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 19:58:00,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:58:00" (1/1) ... [2021-03-11 19:58:00,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:58:00" (1/1) ... [2021-03-11 19:58:00,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:58:00" (1/1) ... [2021-03-11 19:58:00,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:58:00" (1/1) ... [2021-03-11 19:58:00,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:58:00" (1/1) ... [2021-03-11 19:58:00,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:58:00" (1/1) ... [2021-03-11 19:58:00,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:58:00" (1/1) ... [2021-03-11 19:58:00,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 19:58:00,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 19:58:00,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 19:58:00,739 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 19:58:00,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:58:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 19:58:00,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 19:58:00,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 19:58:00,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 19:58:00,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 19:58:00,805 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 19:58:00,806 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 19:58:00,807 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 19:58:00,807 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 19:58:00,807 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 19:58:00,808 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 19:58:00,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 19:58:00,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 19:58:00,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 19:58:00,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 19:58:00,810 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 19:58:02,330 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 19:58:02,331 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 19:58:02,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 07:58:02 BoogieIcfgContainer [2021-03-11 19:58:02,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 19:58:02,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 19:58:02,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 19:58:02,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 19:58:02,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 07:58:00" (1/3) ... [2021-03-11 19:58:02,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502bd695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 07:58:02, skipping insertion in model container [2021-03-11 19:58:02,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:58:00" (2/3) ... [2021-03-11 19:58:02,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502bd695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 07:58:02, skipping insertion in model container [2021-03-11 19:58:02,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 07:58:02" (3/3) ... [2021-03-11 19:58:02,342 INFO L111 eAbstractionObserver]: Analyzing ICFG mix003_rmo.oepc.i [2021-03-11 19:58:02,347 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 19:58:02,351 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 19:58:02,351 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 19:58:02,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,389 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,389 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,390 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,390 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,390 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,390 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,391 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,391 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,396 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,396 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,397 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,397 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,401 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,401 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,402 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,402 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,429 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,429 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,430 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,431 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,432 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,434 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,436 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:02,439 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 19:58:02,455 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-11 19:58:02,483 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 19:58:02,483 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 19:58:02,484 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 19:58:02,484 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 19:58:02,484 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 19:58:02,484 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 19:58:02,484 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 19:58:02,484 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 19:58:02,497 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 221 flow [2021-03-11 19:58:02,545 INFO L129 PetriNetUnfolder]: 2/100 cut-off events. [2021-03-11 19:58:02,546 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 19:58:02,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 100 events. 2/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-03-11 19:58:02,559 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 103 transitions, 221 flow [2021-03-11 19:58:02,563 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 100 transitions, 209 flow [2021-03-11 19:58:02,566 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 19:58:02,577 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 100 transitions, 209 flow [2021-03-11 19:58:02,579 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 100 transitions, 209 flow [2021-03-11 19:58:02,580 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 209 flow [2021-03-11 19:58:02,610 INFO L129 PetriNetUnfolder]: 2/100 cut-off events. [2021-03-11 19:58:02,610 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 19:58:02,612 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 100 events. 2/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-03-11 19:58:02,615 INFO L116 LiptonReduction]: Number of co-enabled transitions 1872 [2021-03-11 19:58:04,618 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-03-11 19:58:05,006 WARN L205 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2021-03-11 19:58:05,162 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-11 19:58:06,638 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-11 19:58:07,240 WARN L205 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-11 19:58:07,384 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-11 19:58:07,712 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-11 19:58:07,851 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-11 19:58:07,855 INFO L131 LiptonReduction]: Checked pairs total: 5907 [2021-03-11 19:58:07,855 INFO L133 LiptonReduction]: Total number of compositions: 85 [2021-03-11 19:58:07,857 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5293 [2021-03-11 19:58:07,871 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-03-11 19:58:07,872 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 19:58:07,872 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:07,872 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-03-11 19:58:07,873 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:07,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:07,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1075592, now seen corresponding path program 1 times [2021-03-11 19:58:07,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:07,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251083707] [2021-03-11 19:58:07,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:58:08,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:08,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:58:08,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:58:08,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251083707] [2021-03-11 19:58:08,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:58:08,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 19:58:08,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621162950] [2021-03-11 19:58:08,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 19:58:08,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:58:08,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 19:58:08,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 19:58:08,066 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 188 [2021-03-11 19:58:08,070 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:08,070 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:58:08,070 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 188 [2021-03-11 19:58:08,071 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:58:08,174 INFO L129 PetriNetUnfolder]: 49/139 cut-off events. [2021-03-11 19:58:08,174 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 19:58:08,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 139 events. 49/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 617 event pairs, 38 based on Foata normal form. 17/148 useless extension candidates. Maximal degree in co-relation 225. Up to 65 conditions per place. [2021-03-11 19:58:08,176 INFO L132 encePairwiseOnDemand]: 184/188 looper letters, 9 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2021-03-11 19:58:08,176 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 29 transitions, 89 flow [2021-03-11 19:58:08,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 19:58:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 19:58:08,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2021-03-11 19:58:08,188 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8599290780141844 [2021-03-11 19:58:08,188 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 485 transitions. [2021-03-11 19:58:08,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 485 transitions. [2021-03-11 19:58:08,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:58:08,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 485 transitions. [2021-03-11 19:58:08,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:08,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:08,202 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:08,204 INFO L185 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 485 transitions. [2021-03-11 19:58:08,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 29 transitions, 89 flow [2021-03-11 19:58:08,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 86 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-11 19:58:08,207 INFO L241 Difference]: Finished difference. Result has 34 places, 25 transitions, 60 flow [2021-03-11 19:58:08,209 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2021-03-11 19:58:08,209 INFO L335 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2021-03-11 19:58:08,209 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 60 flow [2021-03-11 19:58:08,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:08,210 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:08,210 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:58:08,210 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 19:58:08,210 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:08,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:08,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1500351315, now seen corresponding path program 1 times [2021-03-11 19:58:08,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:08,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021365194] [2021-03-11 19:58:08,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:58:08,310 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-11 19:58:08,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 19:58:08,338 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 19:58:08,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 19:58:08,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:58:08,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021365194] [2021-03-11 19:58:08,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:58:08,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 19:58:08,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80172385] [2021-03-11 19:58:08,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 19:58:08,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:58:08,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 19:58:08,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 19:58:08,346 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 188 [2021-03-11 19:58:08,347 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:08,347 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:58:08,347 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 188 [2021-03-11 19:58:08,347 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:58:08,453 INFO L129 PetriNetUnfolder]: 142/294 cut-off events. [2021-03-11 19:58:08,453 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 19:58:08,456 INFO L84 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 294 events. 142/294 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1398 event pairs, 52 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 526. Up to 128 conditions per place. [2021-03-11 19:58:08,458 INFO L132 encePairwiseOnDemand]: 181/188 looper letters, 7 selfloop transitions, 4 changer transitions 12/39 dead transitions. [2021-03-11 19:58:08,458 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 134 flow [2021-03-11 19:58:08,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 19:58:08,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 19:58:08,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 745 transitions. [2021-03-11 19:58:08,465 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7925531914893617 [2021-03-11 19:58:08,465 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 745 transitions. [2021-03-11 19:58:08,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 745 transitions. [2021-03-11 19:58:08,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:58:08,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 745 transitions. [2021-03-11 19:58:08,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:08,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:08,471 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:08,471 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 60 flow. Second operand 5 states and 745 transitions. [2021-03-11 19:58:08,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 134 flow [2021-03-11 19:58:08,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 39 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 19:58:08,473 INFO L241 Difference]: Finished difference. Result has 39 places, 27 transitions, 90 flow [2021-03-11 19:58:08,473 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2021-03-11 19:58:08,473 INFO L335 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2021-03-11 19:58:08,474 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 90 flow [2021-03-11 19:58:08,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:08,474 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:08,474 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:58:08,474 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 19:58:08,474 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:08,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:08,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1272533899, now seen corresponding path program 1 times [2021-03-11 19:58:08,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:08,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471749703] [2021-03-11 19:58:08,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:58:08,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:08,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:08,578 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-11 19:58:08,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 19:58:08,595 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 19:58:08,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 19:58:08,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:58:08,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471749703] [2021-03-11 19:58:08,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:58:08,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 19:58:08,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245567675] [2021-03-11 19:58:08,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 19:58:08,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:58:08,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 19:58:08,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 19:58:08,602 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 188 [2021-03-11 19:58:08,603 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:08,603 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:58:08,603 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 188 [2021-03-11 19:58:08,603 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:58:08,662 INFO L129 PetriNetUnfolder]: 71/182 cut-off events. [2021-03-11 19:58:08,662 INFO L130 PetriNetUnfolder]: For 150/177 co-relation queries the response was YES. [2021-03-11 19:58:08,663 INFO L84 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 182 events. 71/182 cut-off events. For 150/177 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 852 event pairs, 32 based on Foata normal form. 16/195 useless extension candidates. Maximal degree in co-relation 462. Up to 91 conditions per place. [2021-03-11 19:58:08,665 INFO L132 encePairwiseOnDemand]: 184/188 looper letters, 11 selfloop transitions, 3 changer transitions 9/39 dead transitions. [2021-03-11 19:58:08,665 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 39 transitions, 190 flow [2021-03-11 19:58:08,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 19:58:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 19:58:08,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 742 transitions. [2021-03-11 19:58:08,667 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7893617021276595 [2021-03-11 19:58:08,668 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 742 transitions. [2021-03-11 19:58:08,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 742 transitions. [2021-03-11 19:58:08,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:58:08,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 742 transitions. [2021-03-11 19:58:08,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.4) internal successors, (742), 5 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:08,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:08,673 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:08,673 INFO L185 Difference]: Start difference. First operand has 39 places, 27 transitions, 90 flow. Second operand 5 states and 742 transitions. [2021-03-11 19:58:08,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 39 transitions, 190 flow [2021-03-11 19:58:08,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 184 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-11 19:58:08,676 INFO L241 Difference]: Finished difference. Result has 41 places, 27 transitions, 99 flow [2021-03-11 19:58:08,676 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2021-03-11 19:58:08,677 INFO L335 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2021-03-11 19:58:08,677 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 99 flow [2021-03-11 19:58:08,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:08,677 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:08,677 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:58:08,677 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 19:58:08,678 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:08,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:08,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1272616545, now seen corresponding path program 1 times [2021-03-11 19:58:08,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:08,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981755891] [2021-03-11 19:58:08,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:58:08,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:08,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:08,759 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-11 19:58:08,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 19:58:08,769 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 19:58:08,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 19:58:08,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:58:08,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981755891] [2021-03-11 19:58:08,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:58:08,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 19:58:08,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083792873] [2021-03-11 19:58:08,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 19:58:08,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:58:08,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 19:58:08,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 19:58:08,775 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 188 [2021-03-11 19:58:08,776 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:08,776 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:58:08,776 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 188 [2021-03-11 19:58:08,776 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:58:08,822 INFO L129 PetriNetUnfolder]: 52/134 cut-off events. [2021-03-11 19:58:08,822 INFO L130 PetriNetUnfolder]: For 175/209 co-relation queries the response was YES. [2021-03-11 19:58:08,822 INFO L84 FinitePrefix]: Finished finitePrefix Result has 383 conditions, 134 events. 52/134 cut-off events. For 175/209 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 506 event pairs, 8 based on Foata normal form. 13/144 useless extension candidates. Maximal degree in co-relation 368. Up to 67 conditions per place. [2021-03-11 19:58:08,823 INFO L132 encePairwiseOnDemand]: 184/188 looper letters, 11 selfloop transitions, 3 changer transitions 7/37 dead transitions. [2021-03-11 19:58:08,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 37 transitions, 188 flow [2021-03-11 19:58:08,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 19:58:08,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 19:58:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 740 transitions. [2021-03-11 19:58:08,826 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7872340425531915 [2021-03-11 19:58:08,826 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 740 transitions. [2021-03-11 19:58:08,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 740 transitions. [2021-03-11 19:58:08,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:58:08,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 740 transitions. [2021-03-11 19:58:08,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.0) internal successors, (740), 5 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:08,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:08,831 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:08,831 INFO L185 Difference]: Start difference. First operand has 41 places, 27 transitions, 99 flow. Second operand 5 states and 740 transitions. [2021-03-11 19:58:08,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 37 transitions, 188 flow [2021-03-11 19:58:08,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 37 transitions, 176 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-11 19:58:08,833 INFO L241 Difference]: Finished difference. Result has 42 places, 27 transitions, 104 flow [2021-03-11 19:58:08,833 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2021-03-11 19:58:08,833 INFO L335 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2021-03-11 19:58:08,833 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 104 flow [2021-03-11 19:58:08,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:08,834 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:08,834 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:58:08,834 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 19:58:08,834 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:08,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:08,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1804398995, now seen corresponding path program 1 times [2021-03-11 19:58:08,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:08,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552485455] [2021-03-11 19:58:08,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:58:08,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:08,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:08,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:08,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:58:08,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:08,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:58:08,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:58:08,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552485455] [2021-03-11 19:58:08,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:58:08,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 19:58:08,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047020437] [2021-03-11 19:58:08,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 19:58:08,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:58:08,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 19:58:08,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 19:58:08,900 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 188 [2021-03-11 19:58:08,901 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:08,901 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:58:08,901 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 188 [2021-03-11 19:58:08,901 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:58:08,946 INFO L129 PetriNetUnfolder]: 50/152 cut-off events. [2021-03-11 19:58:08,946 INFO L130 PetriNetUnfolder]: For 71/81 co-relation queries the response was YES. [2021-03-11 19:58:08,946 INFO L84 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 152 events. 50/152 cut-off events. For 71/81 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 730 event pairs, 18 based on Foata normal form. 14/160 useless extension candidates. Maximal degree in co-relation 344. Up to 74 conditions per place. [2021-03-11 19:58:08,947 INFO L132 encePairwiseOnDemand]: 182/188 looper letters, 8 selfloop transitions, 8 changer transitions 0/37 dead transitions. [2021-03-11 19:58:08,947 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 37 transitions, 156 flow [2021-03-11 19:58:08,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 19:58:08,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 19:58:08,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 773 transitions. [2021-03-11 19:58:08,950 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8223404255319149 [2021-03-11 19:58:08,950 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 773 transitions. [2021-03-11 19:58:08,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 773 transitions. [2021-03-11 19:58:08,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:58:08,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 773 transitions. [2021-03-11 19:58:08,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.6) internal successors, (773), 5 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:08,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:08,955 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:08,956 INFO L185 Difference]: Start difference. First operand has 42 places, 27 transitions, 104 flow. Second operand 5 states and 773 transitions. [2021-03-11 19:58:08,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 37 transitions, 156 flow [2021-03-11 19:58:08,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 146 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-11 19:58:08,959 INFO L241 Difference]: Finished difference. Result has 43 places, 34 transitions, 154 flow [2021-03-11 19:58:08,960 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2021-03-11 19:58:08,960 INFO L335 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2021-03-11 19:58:08,960 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 154 flow [2021-03-11 19:58:08,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:08,960 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:08,960 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:58:08,960 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 19:58:08,961 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:08,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:08,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1778611314, now seen corresponding path program 1 times [2021-03-11 19:58:08,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:08,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353251687] [2021-03-11 19:58:08,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:58:09,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:09,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:09,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:09,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:09,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:09,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:58:09,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:09,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:58:09,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:58:09,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353251687] [2021-03-11 19:58:09,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:58:09,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 19:58:09,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618579714] [2021-03-11 19:58:09,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 19:58:09,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:58:09,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 19:58:09,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 19:58:09,054 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 188 [2021-03-11 19:58:09,054 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 151.8) internal successors, (759), 5 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:09,055 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:58:09,055 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 188 [2021-03-11 19:58:09,055 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:58:09,105 INFO L129 PetriNetUnfolder]: 34/123 cut-off events. [2021-03-11 19:58:09,105 INFO L130 PetriNetUnfolder]: For 143/235 co-relation queries the response was YES. [2021-03-11 19:58:09,105 INFO L84 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 123 events. 34/123 cut-off events. For 143/235 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 561 event pairs, 3 based on Foata normal form. 51/170 useless extension candidates. Maximal degree in co-relation 398. Up to 67 conditions per place. [2021-03-11 19:58:09,106 INFO L132 encePairwiseOnDemand]: 182/188 looper letters, 5 selfloop transitions, 15 changer transitions 3/44 dead transitions. [2021-03-11 19:58:09,106 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 258 flow [2021-03-11 19:58:09,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 19:58:09,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 19:58:09,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1082 transitions. [2021-03-11 19:58:09,109 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8221884498480243 [2021-03-11 19:58:09,110 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1082 transitions. [2021-03-11 19:58:09,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1082 transitions. [2021-03-11 19:58:09,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:58:09,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1082 transitions. [2021-03-11 19:58:09,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 154.57142857142858) internal successors, (1082), 7 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:09,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:09,115 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:09,115 INFO L185 Difference]: Start difference. First operand has 43 places, 34 transitions, 154 flow. Second operand 7 states and 1082 transitions. [2021-03-11 19:58:09,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 258 flow [2021-03-11 19:58:09,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 19:58:09,117 INFO L241 Difference]: Finished difference. Result has 51 places, 41 transitions, 249 flow [2021-03-11 19:58:09,117 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2021-03-11 19:58:09,118 INFO L335 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2021-03-11 19:58:09,118 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 249 flow [2021-03-11 19:58:09,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 151.8) internal successors, (759), 5 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:09,118 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:09,118 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:58:09,118 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 19:58:09,118 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:09,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:09,119 INFO L82 PathProgramCache]: Analyzing trace with hash -864022124, now seen corresponding path program 1 times [2021-03-11 19:58:09,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:09,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277470824] [2021-03-11 19:58:09,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:58:09,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:09,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:58:09,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:09,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:09,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:09,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:09,240 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-11 19:58:09,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 19:58:09,252 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 19:58:09,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 19:58:09,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:58:09,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277470824] [2021-03-11 19:58:09,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:58:09,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 19:58:09,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984301105] [2021-03-11 19:58:09,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 19:58:09,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:58:09,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 19:58:09,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-11 19:58:09,260 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 188 [2021-03-11 19:58:09,260 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 249 flow. Second operand has 6 states, 6 states have (on average 140.33333333333334) internal successors, (842), 6 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:09,260 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:58:09,261 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 188 [2021-03-11 19:58:09,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:58:09,346 INFO L129 PetriNetUnfolder]: 81/267 cut-off events. [2021-03-11 19:58:09,346 INFO L130 PetriNetUnfolder]: For 656/784 co-relation queries the response was YES. [2021-03-11 19:58:09,348 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1026 conditions, 267 events. 81/267 cut-off events. For 656/784 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1579 event pairs, 7 based on Foata normal form. 9/265 useless extension candidates. Maximal degree in co-relation 1005. Up to 132 conditions per place. [2021-03-11 19:58:09,349 INFO L132 encePairwiseOnDemand]: 180/188 looper letters, 13 selfloop transitions, 9 changer transitions 3/54 dead transitions. [2021-03-11 19:58:09,349 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 360 flow [2021-03-11 19:58:09,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 19:58:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 19:58:09,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 999 transitions. [2021-03-11 19:58:09,352 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7591185410334347 [2021-03-11 19:58:09,353 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 999 transitions. [2021-03-11 19:58:09,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 999 transitions. [2021-03-11 19:58:09,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:58:09,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 999 transitions. [2021-03-11 19:58:09,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 142.71428571428572) internal successors, (999), 7 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:09,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:09,358 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:09,358 INFO L185 Difference]: Start difference. First operand has 51 places, 41 transitions, 249 flow. Second operand 7 states and 999 transitions. [2021-03-11 19:58:09,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 360 flow [2021-03-11 19:58:09,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 325 flow, removed 13 selfloop flow, removed 2 redundant places. [2021-03-11 19:58:09,363 INFO L241 Difference]: Finished difference. Result has 58 places, 45 transitions, 257 flow [2021-03-11 19:58:09,364 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=257, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2021-03-11 19:58:09,364 INFO L335 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2021-03-11 19:58:09,364 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 257 flow [2021-03-11 19:58:09,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 140.33333333333334) internal successors, (842), 6 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:09,364 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:09,364 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:58:09,365 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 19:58:09,365 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:09,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:09,365 INFO L82 PathProgramCache]: Analyzing trace with hash -742588420, now seen corresponding path program 2 times [2021-03-11 19:58:09,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:09,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468212668] [2021-03-11 19:58:09,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:58:09,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:09,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:09,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:09,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:09,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:09,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:09,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:09,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:58:09,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:09,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:58:09,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:58:09,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468212668] [2021-03-11 19:58:09,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:58:09,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 19:58:09,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312007716] [2021-03-11 19:58:09,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 19:58:09,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:58:09,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 19:58:09,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 19:58:09,459 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 188 [2021-03-11 19:58:09,460 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 257 flow. Second operand has 6 states, 6 states have (on average 151.83333333333334) internal successors, (911), 6 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:09,460 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:58:09,460 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 188 [2021-03-11 19:58:09,460 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:58:09,543 INFO L129 PetriNetUnfolder]: 43/166 cut-off events. [2021-03-11 19:58:09,543 INFO L130 PetriNetUnfolder]: For 453/703 co-relation queries the response was YES. [2021-03-11 19:58:09,544 INFO L84 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 166 events. 43/166 cut-off events. For 453/703 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 889 event pairs, 1 based on Foata normal form. 97/253 useless extension candidates. Maximal degree in co-relation 603. Up to 45 conditions per place. [2021-03-11 19:58:09,544 INFO L132 encePairwiseOnDemand]: 182/188 looper letters, 2 selfloop transitions, 17 changer transitions 7/49 dead transitions. [2021-03-11 19:58:09,544 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 49 transitions, 335 flow [2021-03-11 19:58:09,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 19:58:09,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 19:58:09,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1385 transitions. [2021-03-11 19:58:09,548 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8185579196217494 [2021-03-11 19:58:09,548 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1385 transitions. [2021-03-11 19:58:09,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1385 transitions. [2021-03-11 19:58:09,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:58:09,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1385 transitions. [2021-03-11 19:58:09,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 153.88888888888889) internal successors, (1385), 9 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:09,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 188.0) internal successors, (1880), 10 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:09,554 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 188.0) internal successors, (1880), 10 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:09,555 INFO L185 Difference]: Start difference. First operand has 58 places, 45 transitions, 257 flow. Second operand 9 states and 1385 transitions. [2021-03-11 19:58:09,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 49 transitions, 335 flow [2021-03-11 19:58:09,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 49 transitions, 312 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-03-11 19:58:09,558 INFO L241 Difference]: Finished difference. Result has 64 places, 42 transitions, 264 flow [2021-03-11 19:58:09,558 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=264, PETRI_PLACES=64, PETRI_TRANSITIONS=42} [2021-03-11 19:58:09,558 INFO L335 CegarLoopForPetriNet]: 36 programPoint places, 28 predicate places. [2021-03-11 19:58:09,558 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 42 transitions, 264 flow [2021-03-11 19:58:09,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 151.83333333333334) internal successors, (911), 6 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:09,559 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:09,559 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:58:09,559 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 19:58:09,559 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:09,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:09,559 INFO L82 PathProgramCache]: Analyzing trace with hash -308766919, now seen corresponding path program 1 times [2021-03-11 19:58:09,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:09,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429022988] [2021-03-11 19:58:09,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:58:09,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:09,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:58:09,648 INFO L142 QuantifierPusher]: treesize reduction 7, result has 76.7 percent of original size [2021-03-11 19:58:09,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-11 19:58:09,659 INFO L142 QuantifierPusher]: treesize reduction 12, result has 80.3 percent of original size [2021-03-11 19:58:09,660 INFO L147 QuantifierPusher]: treesize reduction 9, result has 81.6 percent of original size 40 [2021-03-11 19:58:09,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:09,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 19:58:09,685 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 19:58:09,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 19:58:09,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:58:09,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429022988] [2021-03-11 19:58:09,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:58:09,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 19:58:09,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231616385] [2021-03-11 19:58:09,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 19:58:09,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:58:09,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 19:58:09,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-11 19:58:09,696 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 188 [2021-03-11 19:58:09,697 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 42 transitions, 264 flow. Second operand has 6 states, 6 states have (on average 134.5) internal successors, (807), 6 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:09,697 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:58:09,697 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 188 [2021-03-11 19:58:09,698 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:58:09,894 INFO L129 PetriNetUnfolder]: 128/506 cut-off events. [2021-03-11 19:58:09,894 INFO L130 PetriNetUnfolder]: For 2743/2985 co-relation queries the response was YES. [2021-03-11 19:58:09,897 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1857 conditions, 506 events. 128/506 cut-off events. For 2743/2985 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3995 event pairs, 13 based on Foata normal form. 74/555 useless extension candidates. Maximal degree in co-relation 1831. Up to 158 conditions per place. [2021-03-11 19:58:09,898 INFO L132 encePairwiseOnDemand]: 180/188 looper letters, 8 selfloop transitions, 8 changer transitions 7/56 dead transitions. [2021-03-11 19:58:09,898 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 56 transitions, 364 flow [2021-03-11 19:58:09,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 19:58:09,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 19:58:09,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 955 transitions. [2021-03-11 19:58:09,901 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7256838905775076 [2021-03-11 19:58:09,901 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 955 transitions. [2021-03-11 19:58:09,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 955 transitions. [2021-03-11 19:58:09,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:58:09,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 955 transitions. [2021-03-11 19:58:09,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.42857142857142) internal successors, (955), 7 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:09,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:09,907 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:09,907 INFO L185 Difference]: Start difference. First operand has 64 places, 42 transitions, 264 flow. Second operand 7 states and 955 transitions. [2021-03-11 19:58:09,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 56 transitions, 364 flow [2021-03-11 19:58:09,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 56 transitions, 294 flow, removed 20 selfloop flow, removed 9 redundant places. [2021-03-11 19:58:09,923 INFO L241 Difference]: Finished difference. Result has 64 places, 49 transitions, 265 flow [2021-03-11 19:58:09,923 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=265, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2021-03-11 19:58:09,923 INFO L335 CegarLoopForPetriNet]: 36 programPoint places, 28 predicate places. [2021-03-11 19:58:09,923 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 265 flow [2021-03-11 19:58:09,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 134.5) internal successors, (807), 6 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:09,924 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:09,924 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:58:09,924 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 19:58:09,924 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:09,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:09,924 INFO L82 PathProgramCache]: Analyzing trace with hash 930966531, now seen corresponding path program 2 times [2021-03-11 19:58:09,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:09,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582241363] [2021-03-11 19:58:09,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:58:10,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:10,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 19:58:10,053 INFO L142 QuantifierPusher]: treesize reduction 5, result has 90.2 percent of original size [2021-03-11 19:58:10,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-11 19:58:10,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:10,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-11 19:58:10,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:10,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 19:58:10,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:10,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 19:58:10,105 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 19:58:10,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 19:58:10,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:58:10,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582241363] [2021-03-11 19:58:10,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:58:10,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 19:58:10,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225924828] [2021-03-11 19:58:10,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 19:58:10,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:58:10,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 19:58:10,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-03-11 19:58:10,124 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 188 [2021-03-11 19:58:10,125 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 265 flow. Second operand has 8 states, 8 states have (on average 126.125) internal successors, (1009), 8 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:10,125 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:58:10,125 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 188 [2021-03-11 19:58:10,125 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:58:10,305 INFO L129 PetriNetUnfolder]: 112/458 cut-off events. [2021-03-11 19:58:10,305 INFO L130 PetriNetUnfolder]: For 1411/1637 co-relation queries the response was YES. [2021-03-11 19:58:10,307 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 458 events. 112/458 cut-off events. For 1411/1637 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3494 event pairs, 7 based on Foata normal form. 92/530 useless extension candidates. Maximal degree in co-relation 1486. Up to 116 conditions per place. [2021-03-11 19:58:10,309 INFO L132 encePairwiseOnDemand]: 181/188 looper letters, 15 selfloop transitions, 6 changer transitions 4/58 dead transitions. [2021-03-11 19:58:10,309 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 58 transitions, 365 flow [2021-03-11 19:58:10,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 19:58:10,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-11 19:58:10,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1019 transitions. [2021-03-11 19:58:10,312 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6775265957446809 [2021-03-11 19:58:10,312 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1019 transitions. [2021-03-11 19:58:10,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1019 transitions. [2021-03-11 19:58:10,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:58:10,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1019 transitions. [2021-03-11 19:58:10,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.375) internal successors, (1019), 8 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:10,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 188.0) internal successors, (1692), 9 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:10,318 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 188.0) internal successors, (1692), 9 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:10,318 INFO L185 Difference]: Start difference. First operand has 64 places, 49 transitions, 265 flow. Second operand 8 states and 1019 transitions. [2021-03-11 19:58:10,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 58 transitions, 365 flow [2021-03-11 19:58:10,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 58 transitions, 359 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-11 19:58:10,328 INFO L241 Difference]: Finished difference. Result has 69 places, 49 transitions, 283 flow [2021-03-11 19:58:10,328 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=283, PETRI_PLACES=69, PETRI_TRANSITIONS=49} [2021-03-11 19:58:10,328 INFO L335 CegarLoopForPetriNet]: 36 programPoint places, 33 predicate places. [2021-03-11 19:58:10,329 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 49 transitions, 283 flow [2021-03-11 19:58:10,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 126.125) internal successors, (1009), 8 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:10,329 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:10,329 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:58:10,329 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 19:58:10,330 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:10,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:10,330 INFO L82 PathProgramCache]: Analyzing trace with hash -338178397, now seen corresponding path program 3 times [2021-03-11 19:58:10,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:10,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507022512] [2021-03-11 19:58:10,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:58:10,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:10,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:10,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:10,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:58:10,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:10,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 19:58:10,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:10,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 19:58:10,418 INFO L142 QuantifierPusher]: treesize reduction 14, result has 36.4 percent of original size [2021-03-11 19:58:10,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-11 19:58:10,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:10,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 19:58:10,437 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 19:58:10,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 19:58:10,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:58:10,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507022512] [2021-03-11 19:58:10,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:58:10,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 19:58:10,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632700197] [2021-03-11 19:58:10,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 19:58:10,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:58:10,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 19:58:10,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-03-11 19:58:10,447 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 188 [2021-03-11 19:58:10,448 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 49 transitions, 283 flow. Second operand has 9 states, 9 states have (on average 122.55555555555556) internal successors, (1103), 9 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:10,448 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:58:10,448 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 188 [2021-03-11 19:58:10,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:58:10,759 INFO L129 PetriNetUnfolder]: 325/1069 cut-off events. [2021-03-11 19:58:10,759 INFO L130 PetriNetUnfolder]: For 2633/2801 co-relation queries the response was YES. [2021-03-11 19:58:10,765 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3702 conditions, 1069 events. 325/1069 cut-off events. For 2633/2801 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 9281 event pairs, 54 based on Foata normal form. 68/1111 useless extension candidates. Maximal degree in co-relation 3679. Up to 240 conditions per place. [2021-03-11 19:58:10,768 INFO L132 encePairwiseOnDemand]: 176/188 looper letters, 23 selfloop transitions, 19 changer transitions 29/95 dead transitions. [2021-03-11 19:58:10,768 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 95 transitions, 673 flow [2021-03-11 19:58:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-11 19:58:10,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-11 19:58:10,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1262 transitions. [2021-03-11 19:58:10,771 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6712765957446809 [2021-03-11 19:58:10,771 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1262 transitions. [2021-03-11 19:58:10,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1262 transitions. [2021-03-11 19:58:10,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:58:10,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1262 transitions. [2021-03-11 19:58:10,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 126.2) internal successors, (1262), 10 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:10,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 188.0) internal successors, (2068), 11 states have internal predecessors, (2068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:10,779 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 188.0) internal successors, (2068), 11 states have internal predecessors, (2068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:10,779 INFO L185 Difference]: Start difference. First operand has 69 places, 49 transitions, 283 flow. Second operand 10 states and 1262 transitions. [2021-03-11 19:58:10,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 95 transitions, 673 flow [2021-03-11 19:58:10,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 95 transitions, 642 flow, removed 7 selfloop flow, removed 5 redundant places. [2021-03-11 19:58:10,806 INFO L241 Difference]: Finished difference. Result has 75 places, 59 transitions, 396 flow [2021-03-11 19:58:10,807 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=396, PETRI_PLACES=75, PETRI_TRANSITIONS=59} [2021-03-11 19:58:10,807 INFO L335 CegarLoopForPetriNet]: 36 programPoint places, 39 predicate places. [2021-03-11 19:58:10,807 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 396 flow [2021-03-11 19:58:10,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 122.55555555555556) internal successors, (1103), 9 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:10,808 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:10,808 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:58:10,808 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 19:58:10,808 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:10,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:10,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1956603995, now seen corresponding path program 4 times [2021-03-11 19:58:10,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:10,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501264913] [2021-03-11 19:58:10,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:58:10,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:10,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:10,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:10,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:58:10,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:10,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 19:58:10,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:10,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 19:58:10,896 INFO L142 QuantifierPusher]: treesize reduction 19, result has 59.6 percent of original size [2021-03-11 19:58:10,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-11 19:58:10,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:10,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 19:58:10,935 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 19:58:10,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 19:58:10,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:58:10,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501264913] [2021-03-11 19:58:10,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:58:10,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 19:58:10,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236129481] [2021-03-11 19:58:10,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 19:58:10,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:58:10,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 19:58:10,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-11 19:58:10,944 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 188 [2021-03-11 19:58:10,945 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 59 transitions, 396 flow. Second operand has 9 states, 9 states have (on average 120.55555555555556) internal successors, (1085), 9 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:10,945 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:58:10,945 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 188 [2021-03-11 19:58:10,945 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:58:11,327 INFO L129 PetriNetUnfolder]: 148/584 cut-off events. [2021-03-11 19:58:11,327 INFO L130 PetriNetUnfolder]: For 1720/1859 co-relation queries the response was YES. [2021-03-11 19:58:11,330 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2275 conditions, 584 events. 148/584 cut-off events. For 1720/1859 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4624 event pairs, 19 based on Foata normal form. 54/625 useless extension candidates. Maximal degree in co-relation 2249. Up to 129 conditions per place. [2021-03-11 19:58:11,332 INFO L132 encePairwiseOnDemand]: 176/188 looper letters, 18 selfloop transitions, 17 changer transitions 34/93 dead transitions. [2021-03-11 19:58:11,332 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 93 transitions, 777 flow [2021-03-11 19:58:11,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-11 19:58:11,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-11 19:58:11,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1477 transitions. [2021-03-11 19:58:11,335 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6546985815602837 [2021-03-11 19:58:11,335 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1477 transitions. [2021-03-11 19:58:11,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1477 transitions. [2021-03-11 19:58:11,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:58:11,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1477 transitions. [2021-03-11 19:58:11,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 123.08333333333333) internal successors, (1477), 12 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:11,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 188.0) internal successors, (2444), 13 states have internal predecessors, (2444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:11,343 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 188.0) internal successors, (2444), 13 states have internal predecessors, (2444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:11,343 INFO L185 Difference]: Start difference. First operand has 75 places, 59 transitions, 396 flow. Second operand 12 states and 1477 transitions. [2021-03-11 19:58:11,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 93 transitions, 777 flow [2021-03-11 19:58:11,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 93 transitions, 752 flow, removed 12 selfloop flow, removed 4 redundant places. [2021-03-11 19:58:11,356 INFO L241 Difference]: Finished difference. Result has 83 places, 54 transitions, 400 flow [2021-03-11 19:58:11,356 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=400, PETRI_PLACES=83, PETRI_TRANSITIONS=54} [2021-03-11 19:58:11,356 INFO L335 CegarLoopForPetriNet]: 36 programPoint places, 47 predicate places. [2021-03-11 19:58:11,356 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 54 transitions, 400 flow [2021-03-11 19:58:11,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 120.55555555555556) internal successors, (1085), 9 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:11,357 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:11,357 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:58:11,357 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 19:58:11,357 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:11,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:11,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1665661323, now seen corresponding path program 5 times [2021-03-11 19:58:11,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:11,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131935176] [2021-03-11 19:58:11,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 19:58:11,413 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 19:58:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 19:58:11,470 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 19:58:11,496 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 19:58:11,496 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 19:58:11,496 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-11 19:58:11,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 07:58:11 BasicIcfg [2021-03-11 19:58:11,571 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 19:58:11,572 INFO L168 Benchmark]: Toolchain (without parser) took 11395.26 ms. Allocated memory was 255.9 MB in the beginning and 557.8 MB in the end (delta: 302.0 MB). Free memory was 233.8 MB in the beginning and 412.3 MB in the end (delta: -178.4 MB). Peak memory consumption was 123.5 MB. Max. memory is 16.0 GB. [2021-03-11 19:58:11,572 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 19:58:11,572 INFO L168 Benchmark]: CACSL2BoogieTranslator took 454.76 ms. Allocated memory was 255.9 MB in the beginning and 367.0 MB in the end (delta: 111.1 MB). Free memory was 233.3 MB in the beginning and 325.7 MB in the end (delta: -92.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-11 19:58:11,573 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.03 ms. Allocated memory is still 367.0 MB. Free memory was 325.7 MB in the beginning and 323.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 19:58:11,573 INFO L168 Benchmark]: Boogie Preprocessor took 31.54 ms. Allocated memory is still 367.0 MB. Free memory was 323.2 MB in the beginning and 321.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 19:58:11,573 INFO L168 Benchmark]: RCFGBuilder took 1594.84 ms. Allocated memory was 367.0 MB in the beginning and 440.4 MB in the end (delta: 73.4 MB). Free memory was 321.1 MB in the beginning and 402.3 MB in the end (delta: -81.2 MB). Peak memory consumption was 60.4 MB. Max. memory is 16.0 GB. [2021-03-11 19:58:11,574 INFO L168 Benchmark]: TraceAbstraction took 9235.17 ms. Allocated memory was 440.4 MB in the beginning and 557.8 MB in the end (delta: 117.4 MB). Free memory was 402.3 MB in the beginning and 412.3 MB in the end (delta: -10.0 MB). Peak memory consumption was 106.4 MB. Max. memory is 16.0 GB. [2021-03-11 19:58:11,583 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 454.76 ms. Allocated memory was 255.9 MB in the beginning and 367.0 MB in the end (delta: 111.1 MB). Free memory was 233.3 MB in the beginning and 325.7 MB in the end (delta: -92.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 55.03 ms. Allocated memory is still 367.0 MB. Free memory was 325.7 MB in the beginning and 323.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 31.54 ms. Allocated memory is still 367.0 MB. Free memory was 323.2 MB in the beginning and 321.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1594.84 ms. Allocated memory was 367.0 MB in the beginning and 440.4 MB in the end (delta: 73.4 MB). Free memory was 321.1 MB in the beginning and 402.3 MB in the end (delta: -81.2 MB). Peak memory consumption was 60.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 9235.17 ms. Allocated memory was 440.4 MB in the beginning and 557.8 MB in the end (delta: 117.4 MB). Free memory was 402.3 MB in the beginning and 412.3 MB in the end (delta: -10.0 MB). Peak memory consumption was 106.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: 5275.9ms, 108 PlacesBefore, 36 PlacesAfterwards, 100 TransitionsBefore, 27 TransitionsAfterwards, 1872 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 85 TotalNumberOfCompositions, 5907 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2625, positive: 2427, positive conditional: 0, positive unconditional: 2427, negative: 198, negative conditional: 0, negative unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1376, positive: 1323, positive conditional: 0, positive unconditional: 1323, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1376, positive: 1293, positive conditional: 0, positive unconditional: 1293, negative: 83, negative conditional: 0, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 83, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 730, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 656, negative conditional: 0, negative unconditional: 656, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2625, positive: 1104, positive conditional: 0, positive unconditional: 1104, negative: 145, negative conditional: 0, negative unconditional: 145, unknown: 1376, unknown conditional: 0, unknown unconditional: 1376] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 162, Positive conditional cache size: 0, Positive unconditional cache size: 162, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - 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; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L727] 0 int z = 0; [L728] 0 _Bool z$flush_delayed; [L729] 0 int z$mem_tmp; [L730] 0 _Bool z$r_buff0_thd0; [L731] 0 _Bool z$r_buff0_thd1; [L732] 0 _Bool z$r_buff0_thd2; [L733] 0 _Bool z$r_buff0_thd3; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$read_delayed; [L739] 0 int *z$read_delayed_var; [L740] 0 int z$w_buff0; [L741] 0 _Bool z$w_buff0_used; [L742] 0 int z$w_buff1; [L743] 0 _Bool z$w_buff1_used; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L845] 0 pthread_t t74; [L846] FCALL, FORK 0 pthread_create(&t74, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$w_buff1 = z$w_buff0 [L750] 1 z$w_buff0 = 1 [L751] 1 z$w_buff1_used = z$w_buff0_used [L752] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L754] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L755] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L756] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L757] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L758] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t75; [L848] FCALL, FORK 0 pthread_create(&t75, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 pthread_t t76; [L850] FCALL, FORK 0 pthread_create(&t76, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 z$flush_delayed = weak$$choice2 [L810] 3 z$mem_tmp = z [L811] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L811] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L812] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L812] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L812] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L812] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L813] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L813] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L813] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L813] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L814] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L814] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L814] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L814] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L815] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L815] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L816] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L816] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L816] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L817] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L817] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EBX = z [L819] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L819] 3 z = z$flush_delayed ? z$mem_tmp : z [L820] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L787] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L788] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L788] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L789] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L789] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L790] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L790] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L791] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L791] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L823] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L823] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L823] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L823] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L824] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L824] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L825] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L825] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L826] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L826] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L827] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L827] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L764] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L765] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L765] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L766] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L766] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L767] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L768] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L768] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L832] 3 return 0; [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L859] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L860] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 102 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 9018.1ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1956.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5385.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 112 SDtfs, 132 SDslu, 183 SDs, 0 SdLazy, 540 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 562.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 556.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=400occurred in iteration=12, InterpolantAutomatonStates: 83, 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: 42.4ms SsaConstructionTime, 423.2ms SatisfiabilityAnalysisTime, 929.4ms InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 1626 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...