/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-10 12:25:14,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-10 12:25:14,037 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-10 12:25:14,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-10 12:25:14,065 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-10 12:25:14,067 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-10 12:25:14,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-10 12:25:14,073 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-10 12:25:14,075 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-10 12:25:14,078 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-10 12:25:14,079 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-10 12:25:14,080 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-10 12:25:14,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-10 12:25:14,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-10 12:25:14,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-10 12:25:14,083 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-10 12:25:14,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-10 12:25:14,086 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-10 12:25:14,087 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-10 12:25:14,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-10 12:25:14,092 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-10 12:25:14,093 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-10 12:25:14,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-10 12:25:14,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-10 12:25:14,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-10 12:25:14,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-10 12:25:14,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-10 12:25:14,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-10 12:25:14,101 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-10 12:25:14,102 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-10 12:25:14,102 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-10 12:25:14,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-10 12:25:14,104 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-10 12:25:14,104 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-10 12:25:14,105 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-10 12:25:14,105 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-10 12:25:14,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-10 12:25:14,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-10 12:25:14,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-10 12:25:14,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-10 12:25:14,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-10 12:25:14,111 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-NoLbe.epf [2021-06-10 12:25:14,138 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-10 12:25:14,138 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-10 12:25:14,140 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-10 12:25:14,140 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-10 12:25:14,140 INFO L138 SettingsManager]: * Use SBE=true [2021-06-10 12:25:14,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-10 12:25:14,140 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-10 12:25:14,141 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-10 12:25:14,141 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-10 12:25:14,141 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-10 12:25:14,141 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-10 12:25:14,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-10 12:25:14,142 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-10 12:25:14,142 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-10 12:25:14,142 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-10 12:25:14,142 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-10 12:25:14,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-10 12:25:14,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-10 12:25:14,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-10 12:25:14,142 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-10 12:25:14,142 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-10 12:25:14,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 12:25:14,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-10 12:25:14,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-10 12:25:14,143 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-10 12:25:14,143 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-10 12:25:14,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-10 12:25:14,143 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-10 12:25:14,143 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-10 12:25:14,143 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-06-10 12:25:14,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-10 12:25:14,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-10 12:25:14,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-10 12:25:14,410 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-10 12:25:14,410 INFO L275 PluginConnector]: CDTParser initialized [2021-06-10 12:25:14,411 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.opt.i [2021-06-10 12:25:14,463 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39c2ae8e3/8b3e78b46e504a0eb39cb33c5e826c83/FLAG367e85204 [2021-06-10 12:25:14,856 INFO L306 CDTParser]: Found 1 translation units. [2021-06-10 12:25:14,856 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.opt.i [2021-06-10 12:25:14,875 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39c2ae8e3/8b3e78b46e504a0eb39cb33c5e826c83/FLAG367e85204 [2021-06-10 12:25:14,887 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39c2ae8e3/8b3e78b46e504a0eb39cb33c5e826c83 [2021-06-10 12:25:14,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-10 12:25:14,889 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-10 12:25:14,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-10 12:25:14,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-10 12:25:14,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-10 12:25:14,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 12:25:14" (1/1) ... [2021-06-10 12:25:14,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@482bffed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:25:14, skipping insertion in model container [2021-06-10 12:25:14,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 12:25:14" (1/1) ... [2021-06-10 12:25:14,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-10 12:25:14,943 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-10 12:25:15,090 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/safe010_power.opt.i[951,964] [2021-06-10 12:25:15,262 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 12:25:15,268 INFO L203 MainTranslator]: Completed pre-run [2021-06-10 12:25:15,279 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/safe010_power.opt.i[951,964] [2021-06-10 12:25:15,322 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 12:25:15,374 INFO L208 MainTranslator]: Completed translation [2021-06-10 12:25:15,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:25:15 WrapperNode [2021-06-10 12:25:15,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-10 12:25:15,376 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-10 12:25:15,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-10 12:25:15,377 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-10 12:25:15,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:25:15" (1/1) ... [2021-06-10 12:25:15,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:25:15" (1/1) ... [2021-06-10 12:25:15,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-10 12:25:15,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-10 12:25:15,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-10 12:25:15,440 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-10 12:25:15,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:25:15" (1/1) ... [2021-06-10 12:25:15,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:25:15" (1/1) ... [2021-06-10 12:25:15,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:25:15" (1/1) ... [2021-06-10 12:25:15,449 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:25:15" (1/1) ... [2021-06-10 12:25:15,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:25:15" (1/1) ... [2021-06-10 12:25:15,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:25:15" (1/1) ... [2021-06-10 12:25:15,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:25:15" (1/1) ... [2021-06-10 12:25:15,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-10 12:25:15,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-10 12:25:15,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-10 12:25:15,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-10 12:25:15,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:25:15" (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-06-10 12:25:15,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-10 12:25:15,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-10 12:25:15,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-10 12:25:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-10 12:25:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-10 12:25:15,540 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-10 12:25:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-10 12:25:15,541 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-10 12:25:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-10 12:25:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-10 12:25:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-10 12:25:15,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-10 12:25:15,542 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-10 12:25:16,870 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-10 12:25:16,870 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-10 12:25:16,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 12:25:16 BoogieIcfgContainer [2021-06-10 12:25:16,872 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-10 12:25:16,873 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-10 12:25:16,873 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-10 12:25:16,875 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-10 12:25:16,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.06 12:25:14" (1/3) ... [2021-06-10 12:25:16,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7a4885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 12:25:16, skipping insertion in model container [2021-06-10 12:25:16,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:25:15" (2/3) ... [2021-06-10 12:25:16,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7a4885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 12:25:16, skipping insertion in model container [2021-06-10 12:25:16,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 12:25:16" (3/3) ... [2021-06-10 12:25:16,877 INFO L111 eAbstractionObserver]: Analyzing ICFG safe010_power.opt.i [2021-06-10 12:25:16,882 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-10 12:25:16,885 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-10 12:25:16,886 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-10 12:25:16,910 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,911 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,911 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,911 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,911 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,911 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,911 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,911 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,912 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,913 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,913 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,913 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,913 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,913 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,915 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,915 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,915 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,915 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,915 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,915 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,915 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,915 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,919 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,920 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,920 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,921 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,921 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:25:16,925 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 12:25:16,937 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-10 12:25:16,957 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 12:25:16,958 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 12:25:16,958 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 12:25:16,958 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 12:25:16,958 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 12:25:16,958 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 12:25:16,958 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 12:25:16,958 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 12:25:16,967 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2021-06-10 12:25:16,995 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2021-06-10 12:25:16,995 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:25:16,998 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-06-10 12:25:16,998 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 80 transitions, 170 flow [2021-06-10 12:25:17,002 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 78 transitions, 162 flow [2021-06-10 12:25:17,011 INFO L129 PetriNetUnfolder]: 0/36 cut-off events. [2021-06-10 12:25:17,012 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:25:17,012 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:25:17,013 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:25:17,015 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:25:17,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:25:17,019 INFO L82 PathProgramCache]: Analyzing trace with hash 932370220, now seen corresponding path program 1 times [2021-06-10 12:25:17,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:25:17,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707832458] [2021-06-10 12:25:17,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:25:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:25:17,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:17,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:17,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:17,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:25:17,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:25:17,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707832458] [2021-06-10 12:25:17,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:25:17,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-10 12:25:17,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597886396] [2021-06-10 12:25:17,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 12:25:17,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:25:17,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 12:25:17,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 12:25:17,276 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 80 [2021-06-10 12:25:17,278 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 78 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-06-10 12:25:17,278 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:25:17,278 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 80 [2021-06-10 12:25:17,279 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:25:17,330 INFO L129 PetriNetUnfolder]: 16/185 cut-off events. [2021-06-10 12:25:17,330 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:25:17,331 INFO L84 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 185 events. 16/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 648 event pairs, 11 based on Foata normal form. 9/183 useless extension candidates. Maximal degree in co-relation 186. Up to 27 conditions per place. [2021-06-10 12:25:17,332 INFO L132 encePairwiseOnDemand]: 75/80 looper letters, 7 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2021-06-10 12:25:17,332 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 77 transitions, 178 flow [2021-06-10 12:25:17,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 12:25:17,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 12:25:17,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2021-06-10 12:25:17,340 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2021-06-10 12:25:17,340 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 224 transitions. [2021-06-10 12:25:17,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 224 transitions. [2021-06-10 12:25:17,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:25:17,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 224 transitions. [2021-06-10 12:25:17,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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-06-10 12:25:17,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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-06-10 12:25:17,350 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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-06-10 12:25:17,351 INFO L185 Difference]: Start difference. First operand has 83 places, 78 transitions, 162 flow. Second operand 3 states and 224 transitions. [2021-06-10 12:25:17,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 77 transitions, 178 flow [2021-06-10 12:25:17,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 77 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 12:25:17,355 INFO L241 Difference]: Finished difference. Result has 81 places, 74 transitions, 156 flow [2021-06-10 12:25:17,357 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=81, PETRI_TRANSITIONS=74} [2021-06-10 12:25:17,357 INFO L343 CegarLoopForPetriNet]: 83 programPoint places, -2 predicate places. [2021-06-10 12:25:17,357 INFO L480 AbstractCegarLoop]: Abstraction has has 81 places, 74 transitions, 156 flow [2021-06-10 12:25:17,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-06-10 12:25:17,357 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:25:17,358 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:25:17,358 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-10 12:25:17,358 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:25:17,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:25:17,358 INFO L82 PathProgramCache]: Analyzing trace with hash -140732567, now seen corresponding path program 1 times [2021-06-10 12:25:17,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:25:17,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426455399] [2021-06-10 12:25:17,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:25:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:25:17,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:17,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:17,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:17,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:25:17,449 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:25:17,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:25:17,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:17,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:25:17,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:17,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:25:17,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:17,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:17,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:25:17,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426455399] [2021-06-10 12:25:17,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:25:17,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-10 12:25:17,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804397019] [2021-06-10 12:25:17,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 12:25:17,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:25:17,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 12:25:17,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-10 12:25:17,483 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 80 [2021-06-10 12:25:17,483 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 74 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 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-06-10 12:25:17,484 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:25:17,484 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 80 [2021-06-10 12:25:17,484 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:25:17,573 INFO L129 PetriNetUnfolder]: 4/107 cut-off events. [2021-06-10 12:25:17,573 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:25:17,574 INFO L84 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 107 events. 4/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 163 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 101. Up to 8 conditions per place. [2021-06-10 12:25:17,574 INFO L132 encePairwiseOnDemand]: 74/80 looper letters, 6 selfloop transitions, 2 changer transitions 21/86 dead transitions. [2021-06-10 12:25:17,574 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 86 transitions, 222 flow [2021-06-10 12:25:17,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-10 12:25:17,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-10 12:25:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 635 transitions. [2021-06-10 12:25:17,577 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8819444444444444 [2021-06-10 12:25:17,577 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 635 transitions. [2021-06-10 12:25:17,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 635 transitions. [2021-06-10 12:25:17,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:25:17,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 635 transitions. [2021-06-10 12:25:17,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 70.55555555555556) internal successors, (635), 9 states have internal predecessors, (635), 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-06-10 12:25:17,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 80.0) internal successors, (800), 10 states have internal predecessors, (800), 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-06-10 12:25:17,582 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 80.0) internal successors, (800), 10 states have internal predecessors, (800), 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-06-10 12:25:17,582 INFO L185 Difference]: Start difference. First operand has 81 places, 74 transitions, 156 flow. Second operand 9 states and 635 transitions. [2021-06-10 12:25:17,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 86 transitions, 222 flow [2021-06-10 12:25:17,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 86 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 12:25:17,584 INFO L241 Difference]: Finished difference. Result has 94 places, 65 transitions, 154 flow [2021-06-10 12:25:17,584 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=154, PETRI_PLACES=94, PETRI_TRANSITIONS=65} [2021-06-10 12:25:17,584 INFO L343 CegarLoopForPetriNet]: 83 programPoint places, 11 predicate places. [2021-06-10 12:25:17,584 INFO L480 AbstractCegarLoop]: Abstraction has has 94 places, 65 transitions, 154 flow [2021-06-10 12:25:17,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 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-06-10 12:25:17,585 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:25:17,585 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:25:17,585 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-10 12:25:17,585 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:25:17,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:25:17,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1897507286, now seen corresponding path program 1 times [2021-06-10 12:25:17,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:25:17,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348381122] [2021-06-10 12:25:17,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:25:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:25:17,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:17,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:17,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:17,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:25:17,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:17,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:25:17,651 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:25:17,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:25:17,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:17,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:25:17,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:17,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:25:17,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:17,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:25:17,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348381122] [2021-06-10 12:25:17,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:25:17,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-10 12:25:17,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425374544] [2021-06-10 12:25:17,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 12:25:17,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:25:17,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 12:25:17,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-10 12:25:17,682 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 80 [2021-06-10 12:25:17,683 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 65 transitions, 154 flow. Second operand has 7 states, 7 states have (on average 67.28571428571429) internal successors, (471), 7 states have internal predecessors, (471), 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-06-10 12:25:17,683 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:25:17,683 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 80 [2021-06-10 12:25:17,683 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:25:17,795 INFO L129 PetriNetUnfolder]: 4/88 cut-off events. [2021-06-10 12:25:17,795 INFO L130 PetriNetUnfolder]: For 17/24 co-relation queries the response was YES. [2021-06-10 12:25:17,796 INFO L84 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 88 events. 4/88 cut-off events. For 17/24 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 138 event pairs, 0 based on Foata normal form. 2/90 useless extension candidates. Maximal degree in co-relation 133. Up to 7 conditions per place. [2021-06-10 12:25:17,796 INFO L132 encePairwiseOnDemand]: 72/80 looper letters, 6 selfloop transitions, 4 changer transitions 12/77 dead transitions. [2021-06-10 12:25:17,796 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 77 transitions, 245 flow [2021-06-10 12:25:17,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-10 12:25:17,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-10 12:25:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 684 transitions. [2021-06-10 12:25:17,799 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.855 [2021-06-10 12:25:17,799 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 684 transitions. [2021-06-10 12:25:17,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 684 transitions. [2021-06-10 12:25:17,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:25:17,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 684 transitions. [2021-06-10 12:25:17,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 68.4) internal successors, (684), 10 states have internal predecessors, (684), 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-06-10 12:25:17,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 80.0) internal successors, (880), 11 states have internal predecessors, (880), 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-06-10 12:25:17,802 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 80.0) internal successors, (880), 11 states have internal predecessors, (880), 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-06-10 12:25:17,802 INFO L185 Difference]: Start difference. First operand has 94 places, 65 transitions, 154 flow. Second operand 10 states and 684 transitions. [2021-06-10 12:25:17,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 77 transitions, 245 flow [2021-06-10 12:25:17,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 77 transitions, 211 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-06-10 12:25:17,804 INFO L241 Difference]: Finished difference. Result has 88 places, 65 transitions, 168 flow [2021-06-10 12:25:17,804 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=168, PETRI_PLACES=88, PETRI_TRANSITIONS=65} [2021-06-10 12:25:17,804 INFO L343 CegarLoopForPetriNet]: 83 programPoint places, 5 predicate places. [2021-06-10 12:25:17,804 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 65 transitions, 168 flow [2021-06-10 12:25:17,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 67.28571428571429) internal successors, (471), 7 states have internal predecessors, (471), 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-06-10 12:25:17,805 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:25:17,805 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 12:25:17,805 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-10 12:25:17,805 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:25:17,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:25:17,806 INFO L82 PathProgramCache]: Analyzing trace with hash 333757561, now seen corresponding path program 1 times [2021-06-10 12:25:17,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:25:17,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739897562] [2021-06-10 12:25:17,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:25:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:25:17,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:17,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:17,966 INFO L142 QuantifierPusher]: treesize reduction 5, result has 37.5 percent of original size [2021-06-10 12:25:17,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:25:17,970 INFO L142 QuantifierPusher]: treesize reduction 4, result has 63.6 percent of original size [2021-06-10 12:25:17,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:25:17,978 INFO L142 QuantifierPusher]: treesize reduction 4, result has 71.4 percent of original size [2021-06-10 12:25:17,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 12:25:17,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:17,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 12:25:17,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:17,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-10 12:25:18,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:18,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-10 12:25:18,036 INFO L142 QuantifierPusher]: treesize reduction 21, result has 74.7 percent of original size [2021-06-10 12:25:18,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-06-10 12:25:18,061 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:25:18,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:25:18,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:18,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:25:18,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:18,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:25:18,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:18,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:25:18,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739897562] [2021-06-10 12:25:18,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:25:18,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-10 12:25:18,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490739104] [2021-06-10 12:25:18,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-10 12:25:18,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:25:18,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-10 12:25:18,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-06-10 12:25:18,106 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 80 [2021-06-10 12:25:18,107 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 65 transitions, 168 flow. Second operand has 12 states, 12 states have (on average 56.25) internal successors, (675), 12 states have internal predecessors, (675), 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-06-10 12:25:18,107 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:25:18,107 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 80 [2021-06-10 12:25:18,107 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:25:18,691 INFO L129 PetriNetUnfolder]: 187/492 cut-off events. [2021-06-10 12:25:18,692 INFO L130 PetriNetUnfolder]: For 225/226 co-relation queries the response was YES. [2021-06-10 12:25:18,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 492 events. 187/492 cut-off events. For 225/226 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2363 event pairs, 15 based on Foata normal form. 12/504 useless extension candidates. Maximal degree in co-relation 972. Up to 123 conditions per place. [2021-06-10 12:25:18,696 INFO L132 encePairwiseOnDemand]: 64/80 looper letters, 29 selfloop transitions, 14 changer transitions 56/144 dead transitions. [2021-06-10 12:25:18,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 144 transitions, 586 flow [2021-06-10 12:25:18,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-10 12:25:18,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-06-10 12:25:18,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1313 transitions. [2021-06-10 12:25:18,699 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7460227272727272 [2021-06-10 12:25:18,699 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1313 transitions. [2021-06-10 12:25:18,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1313 transitions. [2021-06-10 12:25:18,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:25:18,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1313 transitions. [2021-06-10 12:25:18,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 59.68181818181818) internal successors, (1313), 22 states have internal predecessors, (1313), 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-06-10 12:25:18,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 80.0) internal successors, (1840), 23 states have internal predecessors, (1840), 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-06-10 12:25:18,704 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 80.0) internal successors, (1840), 23 states have internal predecessors, (1840), 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-06-10 12:25:18,704 INFO L185 Difference]: Start difference. First operand has 88 places, 65 transitions, 168 flow. Second operand 22 states and 1313 transitions. [2021-06-10 12:25:18,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 144 transitions, 586 flow [2021-06-10 12:25:18,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 144 transitions, 504 flow, removed 36 selfloop flow, removed 10 redundant places. [2021-06-10 12:25:18,710 INFO L241 Difference]: Finished difference. Result has 109 places, 73 transitions, 281 flow [2021-06-10 12:25:18,710 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=281, PETRI_PLACES=109, PETRI_TRANSITIONS=73} [2021-06-10 12:25:18,710 INFO L343 CegarLoopForPetriNet]: 83 programPoint places, 26 predicate places. [2021-06-10 12:25:18,711 INFO L480 AbstractCegarLoop]: Abstraction has has 109 places, 73 transitions, 281 flow [2021-06-10 12:25:18,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 56.25) internal successors, (675), 12 states have internal predecessors, (675), 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-06-10 12:25:18,711 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:25:18,711 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 12:25:18,711 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-10 12:25:18,711 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:25:18,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:25:18,711 INFO L82 PathProgramCache]: Analyzing trace with hash -302891009, now seen corresponding path program 2 times [2021-06-10 12:25:18,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:25:18,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422375530] [2021-06-10 12:25:18,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:25:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:25:18,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:18,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:18,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:18,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:25:18,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:18,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:25:18,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:18,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 12:25:18,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:18,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 12:25:18,868 INFO L142 QuantifierPusher]: treesize reduction 19, result has 80.4 percent of original size [2021-06-10 12:25:18,871 INFO L147 QuantifierPusher]: treesize reduction 9, result has 88.5 percent of original size 69 [2021-06-10 12:25:18,900 INFO L142 QuantifierPusher]: treesize reduction 43, result has 60.9 percent of original size [2021-06-10 12:25:18,905 INFO L147 QuantifierPusher]: treesize reduction 9, result has 86.6 percent of original size 58 [2021-06-10 12:25:18,953 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:25:18,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:25:18,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:18,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:25:18,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:18,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:25:18,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:18,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:18,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:25:18,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422375530] [2021-06-10 12:25:18,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:25:18,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-10 12:25:18,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912643511] [2021-06-10 12:25:18,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-10 12:25:18,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:25:19,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-10 12:25:19,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-10 12:25:19,001 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 80 [2021-06-10 12:25:19,002 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 73 transitions, 281 flow. Second operand has 11 states, 11 states have (on average 60.18181818181818) internal successors, (662), 11 states have internal predecessors, (662), 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-06-10 12:25:19,002 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:25:19,002 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 80 [2021-06-10 12:25:19,002 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:25:19,288 INFO L129 PetriNetUnfolder]: 73/236 cut-off events. [2021-06-10 12:25:19,288 INFO L130 PetriNetUnfolder]: For 1301/1334 co-relation queries the response was YES. [2021-06-10 12:25:19,289 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 236 events. 73/236 cut-off events. For 1301/1334 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 775 event pairs, 18 based on Foata normal form. 27/262 useless extension candidates. Maximal degree in co-relation 947. Up to 78 conditions per place. [2021-06-10 12:25:19,290 INFO L132 encePairwiseOnDemand]: 68/80 looper letters, 14 selfloop transitions, 11 changer transitions 22/98 dead transitions. [2021-06-10 12:25:19,290 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 98 transitions, 657 flow [2021-06-10 12:25:19,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-10 12:25:19,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-06-10 12:25:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 870 transitions. [2021-06-10 12:25:19,292 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7767857142857143 [2021-06-10 12:25:19,292 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 870 transitions. [2021-06-10 12:25:19,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 870 transitions. [2021-06-10 12:25:19,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:25:19,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 870 transitions. [2021-06-10 12:25:19,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 62.142857142857146) internal successors, (870), 14 states have internal predecessors, (870), 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-06-10 12:25:19,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 80.0) internal successors, (1200), 15 states have internal predecessors, (1200), 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-06-10 12:25:19,295 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 80.0) internal successors, (1200), 15 states have internal predecessors, (1200), 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-06-10 12:25:19,295 INFO L185 Difference]: Start difference. First operand has 109 places, 73 transitions, 281 flow. Second operand 14 states and 870 transitions. [2021-06-10 12:25:19,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 98 transitions, 657 flow [2021-06-10 12:25:19,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 98 transitions, 634 flow, removed 7 selfloop flow, removed 7 redundant places. [2021-06-10 12:25:19,299 INFO L241 Difference]: Finished difference. Result has 110 places, 75 transitions, 352 flow [2021-06-10 12:25:19,300 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=352, PETRI_PLACES=110, PETRI_TRANSITIONS=75} [2021-06-10 12:25:19,300 INFO L343 CegarLoopForPetriNet]: 83 programPoint places, 27 predicate places. [2021-06-10 12:25:19,300 INFO L480 AbstractCegarLoop]: Abstraction has has 110 places, 75 transitions, 352 flow [2021-06-10 12:25:19,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 60.18181818181818) internal successors, (662), 11 states have internal predecessors, (662), 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-06-10 12:25:19,300 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:25:19,300 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 12:25:19,301 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-10 12:25:19,301 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:25:19,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:25:19,301 INFO L82 PathProgramCache]: Analyzing trace with hash 100293095, now seen corresponding path program 1 times [2021-06-10 12:25:19,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:25:19,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413431860] [2021-06-10 12:25:19,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:25:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:25:19,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:19,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:19,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:19,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:25:19,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:19,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:25:19,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:19,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 12:25:19,398 INFO L142 QuantifierPusher]: treesize reduction 9, result has 72.7 percent of original size [2021-06-10 12:25:19,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-10 12:25:19,411 INFO L142 QuantifierPusher]: treesize reduction 37, result has 50.7 percent of original size [2021-06-10 12:25:19,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-06-10 12:25:19,434 INFO L142 QuantifierPusher]: treesize reduction 47, result has 53.5 percent of original size [2021-06-10 12:25:19,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-06-10 12:25:19,463 INFO L142 QuantifierPusher]: treesize reduction 46, result has 45.2 percent of original size [2021-06-10 12:25:19,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-06-10 12:25:19,490 INFO L142 QuantifierPusher]: treesize reduction 57, result has 41.2 percent of original size [2021-06-10 12:25:19,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-06-10 12:25:19,521 INFO L142 QuantifierPusher]: treesize reduction 74, result has 1.3 percent of original size [2021-06-10 12:25:19,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:19,522 INFO L142 QuantifierPusher]: treesize reduction 75, result has 1.3 percent of original size [2021-06-10 12:25:19,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:19,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:19,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:19,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:25:19,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413431860] [2021-06-10 12:25:19,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:25:19,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-10 12:25:19,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922856192] [2021-06-10 12:25:19,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-10 12:25:19,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:25:19,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-10 12:25:19,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-10 12:25:19,525 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 80 [2021-06-10 12:25:19,526 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 75 transitions, 352 flow. Second operand has 10 states, 10 states have (on average 54.8) internal successors, (548), 10 states have internal predecessors, (548), 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-06-10 12:25:19,526 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:25:19,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 80 [2021-06-10 12:25:19,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:25:19,954 INFO L129 PetriNetUnfolder]: 199/461 cut-off events. [2021-06-10 12:25:19,954 INFO L130 PetriNetUnfolder]: For 4155/4199 co-relation queries the response was YES. [2021-06-10 12:25:19,955 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2102 conditions, 461 events. 199/461 cut-off events. For 4155/4199 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1798 event pairs, 37 based on Foata normal form. 31/490 useless extension candidates. Maximal degree in co-relation 2024. Up to 154 conditions per place. [2021-06-10 12:25:19,959 INFO L132 encePairwiseOnDemand]: 67/80 looper letters, 50 selfloop transitions, 36 changer transitions 0/129 dead transitions. [2021-06-10 12:25:19,959 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 129 transitions, 902 flow [2021-06-10 12:25:19,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-10 12:25:19,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-06-10 12:25:19,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 771 transitions. [2021-06-10 12:25:19,961 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7413461538461539 [2021-06-10 12:25:19,962 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 771 transitions. [2021-06-10 12:25:19,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 771 transitions. [2021-06-10 12:25:19,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:25:19,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 771 transitions. [2021-06-10 12:25:19,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 59.30769230769231) internal successors, (771), 13 states have internal predecessors, (771), 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-06-10 12:25:19,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 80.0) internal successors, (1120), 14 states have internal predecessors, (1120), 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-06-10 12:25:19,965 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 80.0) internal successors, (1120), 14 states have internal predecessors, (1120), 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-06-10 12:25:19,965 INFO L185 Difference]: Start difference. First operand has 110 places, 75 transitions, 352 flow. Second operand 13 states and 771 transitions. [2021-06-10 12:25:19,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 129 transitions, 902 flow [2021-06-10 12:25:19,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 129 transitions, 758 flow, removed 64 selfloop flow, removed 12 redundant places. [2021-06-10 12:25:19,975 INFO L241 Difference]: Finished difference. Result has 112 places, 101 transitions, 627 flow [2021-06-10 12:25:19,975 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=627, PETRI_PLACES=112, PETRI_TRANSITIONS=101} [2021-06-10 12:25:19,975 INFO L343 CegarLoopForPetriNet]: 83 programPoint places, 29 predicate places. [2021-06-10 12:25:19,975 INFO L480 AbstractCegarLoop]: Abstraction has has 112 places, 101 transitions, 627 flow [2021-06-10 12:25:19,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 54.8) internal successors, (548), 10 states have internal predecessors, (548), 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-06-10 12:25:19,975 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:25:19,976 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 12:25:19,976 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-10 12:25:19,976 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:25:19,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:25:19,976 INFO L82 PathProgramCache]: Analyzing trace with hash 771929063, now seen corresponding path program 2 times [2021-06-10 12:25:19,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:25:19,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804152538] [2021-06-10 12:25:19,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:25:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:25:20,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:20,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:25:20,043 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-10 12:25:20,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-10 12:25:20,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:25:20,062 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-10 12:25:20,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:25:20,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:20,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:25:20,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804152538] [2021-06-10 12:25:20,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:25:20,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-10 12:25:20,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090117841] [2021-06-10 12:25:20,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 12:25:20,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:25:20,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 12:25:20,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-10 12:25:20,070 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 80 [2021-06-10 12:25:20,070 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 101 transitions, 627 flow. Second operand has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 6 states have internal predecessors, (409), 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-06-10 12:25:20,070 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:25:20,070 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 80 [2021-06-10 12:25:20,070 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:25:20,197 INFO L129 PetriNetUnfolder]: 94/313 cut-off events. [2021-06-10 12:25:20,198 INFO L130 PetriNetUnfolder]: For 1049/1059 co-relation queries the response was YES. [2021-06-10 12:25:20,199 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1136 conditions, 313 events. 94/313 cut-off events. For 1049/1059 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1378 event pairs, 16 based on Foata normal form. 13/312 useless extension candidates. Maximal degree in co-relation 1065. Up to 76 conditions per place. [2021-06-10 12:25:20,199 INFO L132 encePairwiseOnDemand]: 72/80 looper letters, 11 selfloop transitions, 12 changer transitions 28/114 dead transitions. [2021-06-10 12:25:20,199 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 114 transitions, 769 flow [2021-06-10 12:25:20,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-10 12:25:20,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-10 12:25:20,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 633 transitions. [2021-06-10 12:25:20,201 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8791666666666667 [2021-06-10 12:25:20,201 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 633 transitions. [2021-06-10 12:25:20,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 633 transitions. [2021-06-10 12:25:20,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:25:20,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 633 transitions. [2021-06-10 12:25:20,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 70.33333333333333) internal successors, (633), 9 states have internal predecessors, (633), 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-06-10 12:25:20,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 80.0) internal successors, (800), 10 states have internal predecessors, (800), 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-06-10 12:25:20,203 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 80.0) internal successors, (800), 10 states have internal predecessors, (800), 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-06-10 12:25:20,203 INFO L185 Difference]: Start difference. First operand has 112 places, 101 transitions, 627 flow. Second operand 9 states and 633 transitions. [2021-06-10 12:25:20,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 114 transitions, 769 flow [2021-06-10 12:25:20,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 114 transitions, 637 flow, removed 57 selfloop flow, removed 7 redundant places. [2021-06-10 12:25:20,208 INFO L241 Difference]: Finished difference. Result has 115 places, 82 transitions, 398 flow [2021-06-10 12:25:20,208 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=398, PETRI_PLACES=115, PETRI_TRANSITIONS=82} [2021-06-10 12:25:20,208 INFO L343 CegarLoopForPetriNet]: 83 programPoint places, 32 predicate places. [2021-06-10 12:25:20,208 INFO L480 AbstractCegarLoop]: Abstraction has has 115 places, 82 transitions, 398 flow [2021-06-10 12:25:20,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 6 states have internal predecessors, (409), 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-06-10 12:25:20,209 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:25:20,209 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 12:25:20,209 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-10 12:25:20,209 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:25:20,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:25:20,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1923571334, now seen corresponding path program 1 times [2021-06-10 12:25:20,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:25:20,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683769960] [2021-06-10 12:25:20,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:25:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:25:20,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:20,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:25:20,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:25:20,247 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-10 12:25:20,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-10 12:25:20,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:25:20,264 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-10 12:25:20,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:25:20,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:20,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:25:20,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683769960] [2021-06-10 12:25:20,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:25:20,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-10 12:25:20,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473923835] [2021-06-10 12:25:20,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 12:25:20,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:25:20,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 12:25:20,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-10 12:25:20,272 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 80 [2021-06-10 12:25:20,273 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 82 transitions, 398 flow. Second operand has 7 states, 7 states have (on average 68.14285714285714) internal successors, (477), 7 states have internal predecessors, (477), 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-06-10 12:25:20,273 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:25:20,273 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 80 [2021-06-10 12:25:20,273 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:25:20,385 INFO L129 PetriNetUnfolder]: 31/183 cut-off events. [2021-06-10 12:25:20,385 INFO L130 PetriNetUnfolder]: For 485/521 co-relation queries the response was YES. [2021-06-10 12:25:20,386 INFO L84 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 183 events. 31/183 cut-off events. For 485/521 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 675 event pairs, 1 based on Foata normal form. 26/202 useless extension candidates. Maximal degree in co-relation 543. Up to 38 conditions per place. [2021-06-10 12:25:20,386 INFO L132 encePairwiseOnDemand]: 72/80 looper letters, 8 selfloop transitions, 16 changer transitions 9/96 dead transitions. [2021-06-10 12:25:20,386 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 96 transitions, 567 flow [2021-06-10 12:25:20,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-10 12:25:20,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-06-10 12:25:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 834 transitions. [2021-06-10 12:25:20,388 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.86875 [2021-06-10 12:25:20,388 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 834 transitions. [2021-06-10 12:25:20,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 834 transitions. [2021-06-10 12:25:20,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:25:20,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 834 transitions. [2021-06-10 12:25:20,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 69.5) internal successors, (834), 12 states have internal predecessors, (834), 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-06-10 12:25:20,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 80.0) internal successors, (1040), 13 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:20,391 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 80.0) internal successors, (1040), 13 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:25:20,391 INFO L185 Difference]: Start difference. First operand has 115 places, 82 transitions, 398 flow. Second operand 12 states and 834 transitions. [2021-06-10 12:25:20,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 96 transitions, 567 flow [2021-06-10 12:25:20,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 96 transitions, 417 flow, removed 73 selfloop flow, removed 17 redundant places. [2021-06-10 12:25:20,395 INFO L241 Difference]: Finished difference. Result has 109 places, 85 transitions, 375 flow [2021-06-10 12:25:20,395 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=375, PETRI_PLACES=109, PETRI_TRANSITIONS=85} [2021-06-10 12:25:20,395 INFO L343 CegarLoopForPetriNet]: 83 programPoint places, 26 predicate places. [2021-06-10 12:25:20,395 INFO L480 AbstractCegarLoop]: Abstraction has has 109 places, 85 transitions, 375 flow [2021-06-10 12:25:20,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 68.14285714285714) internal successors, (477), 7 states have internal predecessors, (477), 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-06-10 12:25:20,395 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:25:20,395 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 12:25:20,395 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-10 12:25:20,396 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:25:20,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:25:20,396 INFO L82 PathProgramCache]: Analyzing trace with hash 416014431, now seen corresponding path program 1 times [2021-06-10 12:25:20,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:25:20,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048369832] [2021-06-10 12:25:20,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:25:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:25:20,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:20,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:25:20,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:25:20,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 12:25:20,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 12:25:20,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 12:25:20,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-10 12:25:20,486 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-06-10 12:25:20,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-06-10 12:25:20,500 INFO L142 QuantifierPusher]: treesize reduction 43, result has 60.9 percent of original size [2021-06-10 12:25:20,501 INFO L147 QuantifierPusher]: treesize reduction 9, result has 86.6 percent of original size 58 [2021-06-10 12:25:20,526 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:25:20,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:25:20,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:25:20,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:25:20,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:25:20,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:25:20,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:25:20,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048369832] [2021-06-10 12:25:20,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:25:20,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-10 12:25:20,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156322787] [2021-06-10 12:25:20,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-10 12:25:20,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:25:20,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-10 12:25:20,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-06-10 12:25:20,562 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 80 [2021-06-10 12:25:20,563 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 85 transitions, 375 flow. Second operand has 12 states, 12 states have (on average 59.416666666666664) internal successors, (713), 12 states have internal predecessors, (713), 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-06-10 12:25:20,563 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:25:20,563 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 80 [2021-06-10 12:25:20,563 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:25:20,696 INFO L129 PetriNetUnfolder]: 21/204 cut-off events. [2021-06-10 12:25:20,697 INFO L130 PetriNetUnfolder]: For 363/368 co-relation queries the response was YES. [2021-06-10 12:25:20,697 INFO L84 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 204 events. 21/204 cut-off events. For 363/368 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 918 event pairs, 2 based on Foata normal form. 2/203 useless extension candidates. Maximal degree in co-relation 524. Up to 36 conditions per place. [2021-06-10 12:25:20,698 INFO L132 encePairwiseOnDemand]: 70/80 looper letters, 13 selfloop transitions, 7 changer transitions 10/91 dead transitions. [2021-06-10 12:25:20,698 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 91 transitions, 451 flow [2021-06-10 12:25:20,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-10 12:25:20,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-10 12:25:20,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 605 transitions. [2021-06-10 12:25:20,699 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.75625 [2021-06-10 12:25:20,699 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 605 transitions. [2021-06-10 12:25:20,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 605 transitions. [2021-06-10 12:25:20,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:25:20,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 605 transitions. [2021-06-10 12:25:20,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 60.5) internal successors, (605), 10 states have internal predecessors, (605), 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-06-10 12:25:20,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 80.0) internal successors, (880), 11 states have internal predecessors, (880), 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-06-10 12:25:20,702 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 80.0) internal successors, (880), 11 states have internal predecessors, (880), 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-06-10 12:25:20,702 INFO L185 Difference]: Start difference. First operand has 109 places, 85 transitions, 375 flow. Second operand 10 states and 605 transitions. [2021-06-10 12:25:20,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 91 transitions, 451 flow [2021-06-10 12:25:20,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 91 transitions, 415 flow, removed 5 selfloop flow, removed 9 redundant places. [2021-06-10 12:25:20,704 INFO L241 Difference]: Finished difference. Result has 111 places, 81 transitions, 339 flow [2021-06-10 12:25:20,704 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=339, PETRI_PLACES=111, PETRI_TRANSITIONS=81} [2021-06-10 12:25:20,704 INFO L343 CegarLoopForPetriNet]: 83 programPoint places, 28 predicate places. [2021-06-10 12:25:20,705 INFO L480 AbstractCegarLoop]: Abstraction has has 111 places, 81 transitions, 339 flow [2021-06-10 12:25:20,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 59.416666666666664) internal successors, (713), 12 states have internal predecessors, (713), 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-06-10 12:25:20,705 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:25:20,705 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 12:25:20,705 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-10 12:25:20,705 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:25:20,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:25:20,705 INFO L82 PathProgramCache]: Analyzing trace with hash 944946101, now seen corresponding path program 2 times [2021-06-10 12:25:20,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:25:20,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509716006] [2021-06-10 12:25:20,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:25:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 12:25:20,728 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 12:25:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 12:25:20,750 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 12:25:20,771 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 12:25:20,771 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 12:25:20,771 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-10 12:25:20,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.06 12:25:20 BasicIcfg [2021-06-10 12:25:20,821 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-10 12:25:20,821 INFO L168 Benchmark]: Toolchain (without parser) took 5931.86 ms. Allocated memory was 381.7 MB in the beginning and 499.1 MB in the end (delta: 117.4 MB). Free memory was 343.7 MB in the beginning and 266.0 MB in the end (delta: 77.7 MB). Peak memory consumption was 196.8 MB. Max. memory is 16.0 GB. [2021-06-10 12:25:20,821 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 381.7 MB. Free memory is still 361.7 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-10 12:25:20,822 INFO L168 Benchmark]: CACSL2BoogieTranslator took 485.36 ms. Allocated memory is still 381.7 MB. Free memory was 343.5 MB in the beginning and 342.5 MB in the end (delta: 1.0 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.0 GB. [2021-06-10 12:25:20,822 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.19 ms. Allocated memory is still 381.7 MB. Free memory was 341.4 MB in the beginning and 339.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 12:25:20,822 INFO L168 Benchmark]: Boogie Preprocessor took 30.96 ms. Allocated memory is still 381.7 MB. Free memory was 339.3 MB in the beginning and 337.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 12:25:20,822 INFO L168 Benchmark]: RCFGBuilder took 1391.52 ms. Allocated memory is still 381.7 MB. Free memory was 336.6 MB in the beginning and 310.5 MB in the end (delta: 26.1 MB). Peak memory consumption was 154.6 MB. Max. memory is 16.0 GB. [2021-06-10 12:25:20,822 INFO L168 Benchmark]: TraceAbstraction took 3947.83 ms. Allocated memory was 381.7 MB in the beginning and 499.1 MB in the end (delta: 117.4 MB). Free memory was 309.5 MB in the beginning and 266.0 MB in the end (delta: 43.5 MB). Peak memory consumption was 160.9 MB. Max. memory is 16.0 GB. [2021-06-10 12:25:20,823 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.09 ms. Allocated memory is still 381.7 MB. Free memory is still 361.7 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 485.36 ms. Allocated memory is still 381.7 MB. Free memory was 343.5 MB in the beginning and 342.5 MB in the end (delta: 1.0 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 63.19 ms. Allocated memory is still 381.7 MB. Free memory was 341.4 MB in the beginning and 339.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 30.96 ms. Allocated memory is still 381.7 MB. Free memory was 339.3 MB in the beginning and 337.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1391.52 ms. Allocated memory is still 381.7 MB. Free memory was 336.6 MB in the beginning and 310.5 MB in the end (delta: 26.1 MB). Peak memory consumption was 154.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 3947.83 ms. Allocated memory was 381.7 MB in the beginning and 499.1 MB in the end (delta: 117.4 MB). Free memory was 309.5 MB in the beginning and 266.0 MB in the end (delta: 43.5 MB). Peak memory consumption was 160.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L711] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L712] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L714] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L716] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L718] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L719] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L720] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L721] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L722] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L723] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L724] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L725] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L726] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L727] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L728] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L729] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L730] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L731] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2011; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] FCALL, FORK 0 pthread_create(&t2011, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] 0 pthread_t t2012; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L795] FCALL, FORK 0 pthread_create(&t2012, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L774] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L805] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 9.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 3817.6ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2073.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 44.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 103 SDtfs, 334 SDslu, 380 SDs, 0 SdLazy, 707 SolverSat, 138 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 504.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1417.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=627occurred in iteration=6, InterpolantAutomatonStates: 102, 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: 29.1ms SsaConstructionTime, 303.6ms SatisfiabilityAnalysisTime, 1149.9ms InterpolantComputationTime, 546 NumberOfCodeBlocks, 546 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 476 ConstructedInterpolants, 0 QuantifiedInterpolants, 2822 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...