/usr/bin/java -Xmx8000000000 -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/mix055_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-12 20:55:27,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-12 20:55:27,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-12 20:55:27,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-12 20:55:27,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-12 20:55:27,166 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-12 20:55:27,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-12 20:55:27,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-12 20:55:27,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-12 20:55:27,178 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-12 20:55:27,178 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-12 20:55:27,179 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-12 20:55:27,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-12 20:55:27,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-12 20:55:27,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-12 20:55:27,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-12 20:55:27,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-12 20:55:27,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-12 20:55:27,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-12 20:55:27,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-12 20:55:27,195 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-12 20:55:27,196 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-12 20:55:27,196 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-12 20:55:27,198 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-12 20:55:27,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-12 20:55:27,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-12 20:55:27,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-12 20:55:27,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-12 20:55:27,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-12 20:55:27,205 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-12 20:55:27,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-12 20:55:27,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-12 20:55:27,207 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-12 20:55:27,208 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-12 20:55:27,209 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-12 20:55:27,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-12 20:55:27,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-12 20:55:27,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-12 20:55:27,210 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-12 20:55:27,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-12 20:55:27,211 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-12 20:55:27,214 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-08-12 20:55:27,235 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-12 20:55:27,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-12 20:55:27,238 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-12 20:55:27,238 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-12 20:55:27,238 INFO L138 SettingsManager]: * Use SBE=true [2021-08-12 20:55:27,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-12 20:55:27,238 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-12 20:55:27,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-12 20:55:27,239 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-12 20:55:27,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-12 20:55:27,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-12 20:55:27,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-12 20:55:27,240 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-12 20:55:27,240 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-12 20:55:27,240 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-12 20:55:27,240 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-12 20:55:27,240 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-12 20:55:27,240 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-12 20:55:27,240 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-12 20:55:27,240 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-12 20:55:27,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-12 20:55:27,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-12 20:55:27,241 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-12 20:55:27,241 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-12 20:55:27,241 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-12 20:55:27,241 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-12 20:55:27,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-12 20:55:27,241 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-12 20:55:27,241 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-12 20:55:27,241 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-12 20:55:27,241 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-08-12 20:55:27,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-12 20:55:27,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-12 20:55:27,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-12 20:55:27,588 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-12 20:55:27,589 INFO L275 PluginConnector]: CDTParser initialized [2021-08-12 20:55:27,589 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_power.opt.i [2021-08-12 20:55:27,646 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/234a93065/d53de52742244ace96f796e4a72681c7/FLAGc3f1fc772 [2021-08-12 20:55:28,109 INFO L306 CDTParser]: Found 1 translation units. [2021-08-12 20:55:28,110 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_power.opt.i [2021-08-12 20:55:28,124 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/234a93065/d53de52742244ace96f796e4a72681c7/FLAGc3f1fc772 [2021-08-12 20:55:28,423 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/234a93065/d53de52742244ace96f796e4a72681c7 [2021-08-12 20:55:28,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-12 20:55:28,427 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-12 20:55:28,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-12 20:55:28,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-12 20:55:28,432 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-12 20:55:28,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 08:55:28" (1/1) ... [2021-08-12 20:55:28,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d68e17a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:55:28, skipping insertion in model container [2021-08-12 20:55:28,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 08:55:28" (1/1) ... [2021-08-12 20:55:28,439 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-12 20:55:28,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-12 20:55:28,638 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_power.opt.i[950,963] [2021-08-12 20:55:28,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 20:55:28,856 INFO L203 MainTranslator]: Completed pre-run [2021-08-12 20:55:28,865 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_power.opt.i[950,963] [2021-08-12 20:55:28,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 20:55:28,968 INFO L208 MainTranslator]: Completed translation [2021-08-12 20:55:28,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:55:28 WrapperNode [2021-08-12 20:55:28,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-12 20:55:28,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-12 20:55:28,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-12 20:55:28,970 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-12 20:55:28,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:55:28" (1/1) ... [2021-08-12 20:55:29,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:55:28" (1/1) ... [2021-08-12 20:55:29,035 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-12 20:55:29,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-12 20:55:29,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-12 20:55:29,036 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-12 20:55:29,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:55:28" (1/1) ... [2021-08-12 20:55:29,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:55:28" (1/1) ... [2021-08-12 20:55:29,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:55:28" (1/1) ... [2021-08-12 20:55:29,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:55:28" (1/1) ... [2021-08-12 20:55:29,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:55:28" (1/1) ... [2021-08-12 20:55:29,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:55:28" (1/1) ... [2021-08-12 20:55:29,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:55:28" (1/1) ... [2021-08-12 20:55:29,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-12 20:55:29,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-12 20:55:29,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-12 20:55:29,083 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-12 20:55:29,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:55:28" (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-08-12 20:55:29,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-12 20:55:29,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-12 20:55:29,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-12 20:55:29,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-12 20:55:29,143 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-12 20:55:29,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-12 20:55:29,143 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-12 20:55:29,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-12 20:55:29,143 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-12 20:55:29,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-12 20:55:29,143 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-08-12 20:55:29,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-08-12 20:55:29,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-12 20:55:29,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-12 20:55:29,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-12 20:55:29,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-12 20:55:29,145 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-12 20:55:30,658 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-12 20:55:30,659 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-12 20:55:30,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 08:55:30 BoogieIcfgContainer [2021-08-12 20:55:30,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-12 20:55:30,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-12 20:55:30,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-12 20:55:30,664 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-12 20:55:30,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.08 08:55:28" (1/3) ... [2021-08-12 20:55:30,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ab2a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 08:55:30, skipping insertion in model container [2021-08-12 20:55:30,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:55:28" (2/3) ... [2021-08-12 20:55:30,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ab2a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 08:55:30, skipping insertion in model container [2021-08-12 20:55:30,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 08:55:30" (3/3) ... [2021-08-12 20:55:30,667 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_power.opt.i [2021-08-12 20:55:30,674 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-12 20:55:30,674 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-12 20:55:30,675 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-12 20:55:30,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,722 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,722 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,722 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,723 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,723 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,723 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,724 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,724 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,725 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,725 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,725 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,725 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,731 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,732 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,732 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,732 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,732 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,732 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,732 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,733 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,737 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,738 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,738 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,738 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,738 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,738 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,738 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,738 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,740 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,740 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,741 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,741 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,742 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,742 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,742 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,743 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,745 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,746 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,749 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,749 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,751 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,751 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:55:30,752 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-12 20:55:30,772 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-08-12 20:55:30,793 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-12 20:55:30,793 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-12 20:55:30,793 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-12 20:55:30,793 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-12 20:55:30,793 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-12 20:55:30,794 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-12 20:55:30,794 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-12 20:55:30,794 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-12 20:55:30,805 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 270 flow [2021-08-12 20:55:30,855 INFO L129 PetriNetUnfolder]: 2/121 cut-off events. [2021-08-12 20:55:30,855 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 20:55:30,862 INFO L84 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2021-08-12 20:55:30,862 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 125 transitions, 270 flow [2021-08-12 20:55:30,869 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 121 transitions, 254 flow [2021-08-12 20:55:30,888 INFO L129 PetriNetUnfolder]: 0/86 cut-off events. [2021-08-12 20:55:30,888 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 20:55:30,888 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:55:30,889 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:55:30,890 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:55:30,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:55:30,893 INFO L82 PathProgramCache]: Analyzing trace with hash -882581900, now seen corresponding path program 1 times [2021-08-12 20:55:30,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:55:30,899 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553926290] [2021-08-12 20:55:30,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:55:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:55:31,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:31,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:31,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:31,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:55:31,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:55:31,145 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:55:31,145 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553926290] [2021-08-12 20:55:31,146 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553926290] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:55:31,146 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:55:31,146 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-12 20:55:31,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673378437] [2021-08-12 20:55:31,152 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-12 20:55:31,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:55:31,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-12 20:55:31,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 20:55:31,163 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 125 [2021-08-12 20:55:31,165 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 121 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-08-12 20:55:31,165 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:55:31,165 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 125 [2021-08-12 20:55:31,166 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:55:31,226 INFO L129 PetriNetUnfolder]: 16/243 cut-off events. [2021-08-12 20:55:31,226 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 20:55:31,228 INFO L84 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 243 events. 16/243 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 722 event pairs, 6 based on Foata normal form. 9/241 useless extension candidates. Maximal degree in co-relation 239. Up to 27 conditions per place. [2021-08-12 20:55:31,229 INFO L132 encePairwiseOnDemand]: 120/125 looper letters, 7 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2021-08-12 20:55:31,229 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 120 transitions, 270 flow [2021-08-12 20:55:31,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-12 20:55:31,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-12 20:55:31,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2021-08-12 20:55:31,239 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9573333333333334 [2021-08-12 20:55:31,239 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2021-08-12 20:55:31,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2021-08-12 20:55:31,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:55:31,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2021-08-12 20:55:31,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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-08-12 20:55:31,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 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-08-12 20:55:31,250 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 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-08-12 20:55:31,250 INFO L348 CegarLoopForPetriNet]: 132 programPoint places, 0 predicate places. [2021-08-12 20:55:31,251 INFO L482 AbstractCegarLoop]: Abstraction has has 132 places, 120 transitions, 270 flow [2021-08-12 20:55:31,251 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-08-12 20:55:31,251 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:55:31,251 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:55:31,251 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-12 20:55:31,251 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:55:31,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:55:31,252 INFO L82 PathProgramCache]: Analyzing trace with hash 414741433, now seen corresponding path program 1 times [2021-08-12 20:55:31,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:55:31,252 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099691122] [2021-08-12 20:55:31,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:55:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:55:31,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:31,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:31,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:31,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:55:31,363 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:55:31,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:55:31,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:31,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:55:31,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:31,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:55:31,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:31,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:31,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:55:31,392 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:55:31,393 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099691122] [2021-08-12 20:55:31,393 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099691122] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:55:31,393 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:55:31,393 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 20:55:31,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386547488] [2021-08-12 20:55:31,395 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 20:55:31,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:55:31,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 20:55:31,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 20:55:31,398 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 125 [2021-08-12 20:55:31,399 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 120 transitions, 270 flow. Second operand has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 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-08-12 20:55:31,399 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:55:31,399 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 125 [2021-08-12 20:55:31,399 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:55:31,716 INFO L129 PetriNetUnfolder]: 205/1241 cut-off events. [2021-08-12 20:55:31,716 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-08-12 20:55:31,724 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1730 conditions, 1241 events. 205/1241 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 10413 event pairs, 48 based on Foata normal form. 0/1206 useless extension candidates. Maximal degree in co-relation 1675. Up to 186 conditions per place. [2021-08-12 20:55:31,727 INFO L132 encePairwiseOnDemand]: 118/125 looper letters, 10 selfloop transitions, 3 changer transitions 22/144 dead transitions. [2021-08-12 20:55:31,727 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 144 transitions, 392 flow [2021-08-12 20:55:31,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 20:55:31,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-12 20:55:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1043 transitions. [2021-08-12 20:55:31,734 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9271111111111111 [2021-08-12 20:55:31,734 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1043 transitions. [2021-08-12 20:55:31,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1043 transitions. [2021-08-12 20:55:31,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:55:31,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1043 transitions. [2021-08-12 20:55:31,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 115.88888888888889) internal successors, (1043), 9 states have internal predecessors, (1043), 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-08-12 20:55:31,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 125.0) internal successors, (1250), 10 states have internal predecessors, (1250), 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-08-12 20:55:31,746 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 125.0) internal successors, (1250), 10 states have internal predecessors, (1250), 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-08-12 20:55:31,746 INFO L348 CegarLoopForPetriNet]: 132 programPoint places, 8 predicate places. [2021-08-12 20:55:31,747 INFO L482 AbstractCegarLoop]: Abstraction has has 140 places, 144 transitions, 392 flow [2021-08-12 20:55:31,747 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 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-08-12 20:55:31,747 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:55:31,747 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:55:31,747 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-12 20:55:31,748 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:55:31,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:55:31,748 INFO L82 PathProgramCache]: Analyzing trace with hash -125593222, now seen corresponding path program 1 times [2021-08-12 20:55:31,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:55:31,749 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676928362] [2021-08-12 20:55:31,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:55:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:55:31,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:31,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:31,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:31,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:55:31,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:31,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:55:31,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:31,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 20:55:31,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:31,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-12 20:55:31,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:31,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-12 20:55:31,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:31,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 20:55:31,975 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:55:31,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:55:31,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:31,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:55:32,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:32,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:55:32,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:32,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:32,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:55:32,016 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:55:32,016 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676928362] [2021-08-12 20:55:32,016 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676928362] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:55:32,016 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:55:32,016 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-12 20:55:32,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169072124] [2021-08-12 20:55:32,017 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-12 20:55:32,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:55:32,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-12 20:55:32,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-08-12 20:55:32,020 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 125 [2021-08-12 20:55:32,021 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 144 transitions, 392 flow. Second operand has 11 states, 11 states have (on average 105.0909090909091) internal successors, (1156), 11 states have internal predecessors, (1156), 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-08-12 20:55:32,021 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:55:32,021 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 125 [2021-08-12 20:55:32,021 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:55:32,623 INFO L129 PetriNetUnfolder]: 1143/3425 cut-off events. [2021-08-12 20:55:32,623 INFO L130 PetriNetUnfolder]: For 644/695 co-relation queries the response was YES. [2021-08-12 20:55:32,639 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6352 conditions, 3425 events. 1143/3425 cut-off events. For 644/695 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 31669 event pairs, 190 based on Foata normal form. 2/3356 useless extension candidates. Maximal degree in co-relation 6290. Up to 658 conditions per place. [2021-08-12 20:55:32,646 INFO L132 encePairwiseOnDemand]: 112/125 looper letters, 15 selfloop transitions, 11 changer transitions 100/217 dead transitions. [2021-08-12 20:55:32,646 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 217 transitions, 876 flow [2021-08-12 20:55:32,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-12 20:55:32,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-12 20:55:32,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1728 transitions. [2021-08-12 20:55:32,649 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.864 [2021-08-12 20:55:32,649 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1728 transitions. [2021-08-12 20:55:32,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1728 transitions. [2021-08-12 20:55:32,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:55:32,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1728 transitions. [2021-08-12 20:55:32,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 108.0) internal successors, (1728), 16 states have internal predecessors, (1728), 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-08-12 20:55:32,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 125.0) internal successors, (2125), 17 states have internal predecessors, (2125), 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-08-12 20:55:32,657 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 125.0) internal successors, (2125), 17 states have internal predecessors, (2125), 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-08-12 20:55:32,657 INFO L348 CegarLoopForPetriNet]: 132 programPoint places, 23 predicate places. [2021-08-12 20:55:32,657 INFO L482 AbstractCegarLoop]: Abstraction has has 155 places, 217 transitions, 876 flow [2021-08-12 20:55:32,657 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 105.0909090909091) internal successors, (1156), 11 states have internal predecessors, (1156), 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-08-12 20:55:32,657 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:55:32,658 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:55:32,658 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-12 20:55:32,658 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:55:32,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:55:32,658 INFO L82 PathProgramCache]: Analyzing trace with hash -390852900, now seen corresponding path program 1 times [2021-08-12 20:55:32,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:55:32,659 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493692589] [2021-08-12 20:55:32,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:55:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:55:32,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:32,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:32,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:32,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:55:32,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:32,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:55:32,812 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:32,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 20:55:32,822 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-08-12 20:55:32,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-08-12 20:55:32,846 INFO L142 QuantifierPusher]: treesize reduction 31, result has 75.2 percent of original size [2021-08-12 20:55:32,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-08-12 20:55:32,859 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:55:32,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:55:32,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:32,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:55:32,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:32,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:55:32,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:32,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:32,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:55:32,894 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:55:32,894 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493692589] [2021-08-12 20:55:32,894 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493692589] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:55:32,895 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:55:32,895 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-12 20:55:32,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76713979] [2021-08-12 20:55:32,896 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-12 20:55:32,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:55:32,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-12 20:55:32,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-08-12 20:55:32,898 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 125 [2021-08-12 20:55:32,899 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 217 transitions, 876 flow. Second operand has 9 states, 9 states have (on average 106.33333333333333) internal successors, (957), 9 states have internal predecessors, (957), 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-08-12 20:55:32,899 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:55:32,899 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 125 [2021-08-12 20:55:32,899 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:55:33,582 INFO L129 PetriNetUnfolder]: 1370/4244 cut-off events. [2021-08-12 20:55:33,582 INFO L130 PetriNetUnfolder]: For 1017/1217 co-relation queries the response was YES. [2021-08-12 20:55:33,598 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9372 conditions, 4244 events. 1370/4244 cut-off events. For 1017/1217 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 41892 event pairs, 266 based on Foata normal form. 18/4169 useless extension candidates. Maximal degree in co-relation 9304. Up to 947 conditions per place. [2021-08-12 20:55:33,604 INFO L132 encePairwiseOnDemand]: 114/125 looper letters, 16 selfloop transitions, 10 changer transitions 142/260 dead transitions. [2021-08-12 20:55:33,604 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 260 transitions, 1414 flow [2021-08-12 20:55:33,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-12 20:55:33,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-12 20:55:33,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1742 transitions. [2021-08-12 20:55:33,608 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.871 [2021-08-12 20:55:33,608 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1742 transitions. [2021-08-12 20:55:33,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1742 transitions. [2021-08-12 20:55:33,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:55:33,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1742 transitions. [2021-08-12 20:55:33,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 108.875) internal successors, (1742), 16 states have internal predecessors, (1742), 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-08-12 20:55:33,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 125.0) internal successors, (2125), 17 states have internal predecessors, (2125), 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-08-12 20:55:33,616 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 125.0) internal successors, (2125), 17 states have internal predecessors, (2125), 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-08-12 20:55:33,616 INFO L348 CegarLoopForPetriNet]: 132 programPoint places, 38 predicate places. [2021-08-12 20:55:33,616 INFO L482 AbstractCegarLoop]: Abstraction has has 170 places, 260 transitions, 1414 flow [2021-08-12 20:55:33,616 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 106.33333333333333) internal successors, (957), 9 states have internal predecessors, (957), 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-08-12 20:55:33,616 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:55:33,616 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:55:33,617 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-12 20:55:33,617 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:55:33,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:55:33,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1734672821, now seen corresponding path program 1 times [2021-08-12 20:55:33,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:55:33,620 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852376735] [2021-08-12 20:55:33,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:55:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:55:33,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:33,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:33,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:33,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:55:33,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:33,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:55:33,745 INFO L142 QuantifierPusher]: treesize reduction 36, result has 64.4 percent of original size [2021-08-12 20:55:33,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-08-12 20:55:33,770 INFO L142 QuantifierPusher]: treesize reduction 36, result has 65.4 percent of original size [2021-08-12 20:55:33,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-08-12 20:55:33,792 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:55:33,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:55:33,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:33,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:55:33,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:33,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:55:33,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:33,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:55:33,823 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:55:33,823 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852376735] [2021-08-12 20:55:33,823 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852376735] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:55:33,823 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:55:33,823 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-12 20:55:33,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618425407] [2021-08-12 20:55:33,824 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-12 20:55:33,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:55:33,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-12 20:55:33,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-08-12 20:55:33,826 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 125 [2021-08-12 20:55:33,827 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 260 transitions, 1414 flow. Second operand has 9 states, 9 states have (on average 107.22222222222223) internal successors, (965), 9 states have internal predecessors, (965), 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-08-12 20:55:33,827 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:55:33,827 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 125 [2021-08-12 20:55:33,827 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:55:34,694 INFO L129 PetriNetUnfolder]: 1627/5172 cut-off events. [2021-08-12 20:55:34,694 INFO L130 PetriNetUnfolder]: For 1681/2063 co-relation queries the response was YES. [2021-08-12 20:55:34,721 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13225 conditions, 5172 events. 1627/5172 cut-off events. For 1681/2063 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 53814 event pairs, 201 based on Foata normal form. 26/5092 useless extension candidates. Maximal degree in co-relation 13152. Up to 1295 conditions per place. [2021-08-12 20:55:34,729 INFO L132 encePairwiseOnDemand]: 116/125 looper letters, 24 selfloop transitions, 7 changer transitions 231/355 dead transitions. [2021-08-12 20:55:34,730 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 355 transitions, 2656 flow [2021-08-12 20:55:34,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-12 20:55:34,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-08-12 20:55:34,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1545 transitions. [2021-08-12 20:55:34,733 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8828571428571429 [2021-08-12 20:55:34,733 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1545 transitions. [2021-08-12 20:55:34,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1545 transitions. [2021-08-12 20:55:34,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:55:34,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1545 transitions. [2021-08-12 20:55:34,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 110.35714285714286) internal successors, (1545), 14 states have internal predecessors, (1545), 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-08-12 20:55:34,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 125.0) internal successors, (1875), 15 states have internal predecessors, (1875), 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-08-12 20:55:34,738 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 125.0) internal successors, (1875), 15 states have internal predecessors, (1875), 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-08-12 20:55:34,738 INFO L348 CegarLoopForPetriNet]: 132 programPoint places, 51 predicate places. [2021-08-12 20:55:34,738 INFO L482 AbstractCegarLoop]: Abstraction has has 183 places, 355 transitions, 2656 flow [2021-08-12 20:55:34,739 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 107.22222222222223) internal successors, (965), 9 states have internal predecessors, (965), 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-08-12 20:55:34,739 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:55:34,739 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:55:34,739 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-12 20:55:34,739 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:55:34,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:55:34,740 INFO L82 PathProgramCache]: Analyzing trace with hash 409059836, now seen corresponding path program 1 times [2021-08-12 20:55:34,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:55:34,740 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350337903] [2021-08-12 20:55:34,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:55:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:55:34,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:34,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:34,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:34,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:55:34,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:34,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:55:34,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:34,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 20:55:34,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:34,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-12 20:55:34,829 INFO L142 QuantifierPusher]: treesize reduction 6, result has 91.4 percent of original size [2021-08-12 20:55:34,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-08-12 20:55:34,838 INFO L142 QuantifierPusher]: treesize reduction 6, result has 91.8 percent of original size [2021-08-12 20:55:34,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 67 [2021-08-12 20:55:34,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:34,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-08-12 20:55:34,874 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:55:34,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:55:34,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:34,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:55:34,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:34,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:55:34,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:34,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:34,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:55:34,907 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:55:34,907 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350337903] [2021-08-12 20:55:34,907 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350337903] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:55:34,907 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:55:34,907 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-12 20:55:34,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155468202] [2021-08-12 20:55:34,908 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-12 20:55:34,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:55:34,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-12 20:55:34,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-08-12 20:55:34,909 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 125 [2021-08-12 20:55:34,910 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 355 transitions, 2656 flow. Second operand has 11 states, 11 states have (on average 105.27272727272727) internal successors, (1158), 11 states have internal predecessors, (1158), 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-08-12 20:55:34,910 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:55:34,911 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 125 [2021-08-12 20:55:34,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:55:36,260 INFO L129 PetriNetUnfolder]: 1692/5408 cut-off events. [2021-08-12 20:55:36,260 INFO L130 PetriNetUnfolder]: For 1989/2442 co-relation queries the response was YES. [2021-08-12 20:55:36,312 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15637 conditions, 5408 events. 1692/5408 cut-off events. For 1989/2442 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 57229 event pairs, 206 based on Foata normal form. 58/5381 useless extension candidates. Maximal degree in co-relation 15557. Up to 1348 conditions per place. [2021-08-12 20:55:36,323 INFO L132 encePairwiseOnDemand]: 114/125 looper letters, 19 selfloop transitions, 9 changer transitions 253/372 dead transitions. [2021-08-12 20:55:36,324 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 372 transitions, 3342 flow [2021-08-12 20:55:36,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-12 20:55:36,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-08-12 20:55:36,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1836 transitions. [2021-08-12 20:55:36,329 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.864 [2021-08-12 20:55:36,329 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1836 transitions. [2021-08-12 20:55:36,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1836 transitions. [2021-08-12 20:55:36,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:55:36,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1836 transitions. [2021-08-12 20:55:36,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 108.0) internal successors, (1836), 17 states have internal predecessors, (1836), 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-08-12 20:55:36,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 125.0) internal successors, (2250), 18 states have internal predecessors, (2250), 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-08-12 20:55:36,342 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 125.0) internal successors, (2250), 18 states have internal predecessors, (2250), 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-08-12 20:55:36,342 INFO L348 CegarLoopForPetriNet]: 132 programPoint places, 67 predicate places. [2021-08-12 20:55:36,342 INFO L482 AbstractCegarLoop]: Abstraction has has 199 places, 372 transitions, 3342 flow [2021-08-12 20:55:36,342 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 105.27272727272727) internal successors, (1158), 11 states have internal predecessors, (1158), 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-08-12 20:55:36,342 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:55:36,345 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:55:36,346 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-12 20:55:36,346 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:55:36,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:55:36,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1664879453, now seen corresponding path program 1 times [2021-08-12 20:55:36,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:55:36,346 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960603784] [2021-08-12 20:55:36,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:55:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:55:36,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:36,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:36,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:36,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:55:36,477 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 20:55:36,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 20:55:36,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:36,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:55:36,519 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 20:55:36,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:55:36,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:36,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:36,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:55:36,528 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:55:36,528 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960603784] [2021-08-12 20:55:36,528 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960603784] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:55:36,528 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:55:36,528 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 20:55:36,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778058492] [2021-08-12 20:55:36,528 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 20:55:36,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:55:36,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 20:55:36,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 20:55:36,529 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 125 [2021-08-12 20:55:36,530 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 372 transitions, 3342 flow. Second operand has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 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-08-12 20:55:36,530 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:55:36,530 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 125 [2021-08-12 20:55:36,530 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:55:37,637 INFO L129 PetriNetUnfolder]: 2472/8080 cut-off events. [2021-08-12 20:55:37,637 INFO L130 PetriNetUnfolder]: For 3070/3949 co-relation queries the response was YES. [2021-08-12 20:55:37,671 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22328 conditions, 8080 events. 2472/8080 cut-off events. For 3070/3949 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 93232 event pairs, 417 based on Foata normal form. 0/7664 useless extension candidates. Maximal degree in co-relation 22245. Up to 1986 conditions per place. [2021-08-12 20:55:37,728 INFO L132 encePairwiseOnDemand]: 114/125 looper letters, 29 selfloop transitions, 20 changer transitions 17/325 dead transitions. [2021-08-12 20:55:37,729 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 325 transitions, 2498 flow [2021-08-12 20:55:37,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-12 20:55:37,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-12 20:55:37,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1151 transitions. [2021-08-12 20:55:37,732 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9208 [2021-08-12 20:55:37,733 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1151 transitions. [2021-08-12 20:55:37,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1151 transitions. [2021-08-12 20:55:37,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:55:37,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1151 transitions. [2021-08-12 20:55:37,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 115.1) internal successors, (1151), 10 states have internal predecessors, (1151), 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-08-12 20:55:37,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 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-08-12 20:55:37,753 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 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-08-12 20:55:37,753 INFO L348 CegarLoopForPetriNet]: 132 programPoint places, 76 predicate places. [2021-08-12 20:55:37,753 INFO L482 AbstractCegarLoop]: Abstraction has has 208 places, 325 transitions, 2498 flow [2021-08-12 20:55:37,754 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 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-08-12 20:55:37,754 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:55:37,754 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:55:37,754 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-12 20:55:37,754 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:55:37,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:55:37,755 INFO L82 PathProgramCache]: Analyzing trace with hash -981930745, now seen corresponding path program 1 times [2021-08-12 20:55:37,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:55:37,755 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196282934] [2021-08-12 20:55:37,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:55:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:55:37,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:37,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:37,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:37,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:55:37,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:37,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:55:37,851 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 20:55:37,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 20:55:37,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:37,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:55:37,871 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 20:55:37,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:55:37,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:37,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:37,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:55:37,879 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:55:37,879 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196282934] [2021-08-12 20:55:37,879 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196282934] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:55:37,879 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:55:37,879 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 20:55:37,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038744864] [2021-08-12 20:55:37,880 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 20:55:37,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:55:37,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 20:55:37,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-12 20:55:37,881 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 125 [2021-08-12 20:55:37,882 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 325 transitions, 2498 flow. Second operand has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:55:37,882 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:55:37,882 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 125 [2021-08-12 20:55:37,882 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:55:38,516 INFO L129 PetriNetUnfolder]: 1158/3508 cut-off events. [2021-08-12 20:55:38,516 INFO L130 PetriNetUnfolder]: For 1318/2462 co-relation queries the response was YES. [2021-08-12 20:55:38,527 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10129 conditions, 3508 events. 1158/3508 cut-off events. For 1318/2462 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 32294 event pairs, 110 based on Foata normal form. 58/3298 useless extension candidates. Maximal degree in co-relation 10043. Up to 698 conditions per place. [2021-08-12 20:55:38,534 INFO L132 encePairwiseOnDemand]: 114/125 looper letters, 52 selfloop transitions, 54 changer transitions 125/365 dead transitions. [2021-08-12 20:55:38,534 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 365 transitions, 2732 flow [2021-08-12 20:55:38,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-12 20:55:38,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-12 20:55:38,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1498 transitions. [2021-08-12 20:55:38,537 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9218461538461539 [2021-08-12 20:55:38,537 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1498 transitions. [2021-08-12 20:55:38,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1498 transitions. [2021-08-12 20:55:38,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:55:38,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1498 transitions. [2021-08-12 20:55:38,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 115.23076923076923) internal successors, (1498), 13 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:55:38,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 125.0) internal successors, (1750), 14 states have internal predecessors, (1750), 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-08-12 20:55:38,543 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 125.0) internal successors, (1750), 14 states have internal predecessors, (1750), 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-08-12 20:55:38,543 INFO L348 CegarLoopForPetriNet]: 132 programPoint places, 88 predicate places. [2021-08-12 20:55:38,543 INFO L482 AbstractCegarLoop]: Abstraction has has 220 places, 365 transitions, 2732 flow [2021-08-12 20:55:38,543 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:55:38,543 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:55:38,543 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:55:38,543 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-12 20:55:38,544 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:55:38,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:55:38,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1051183556, now seen corresponding path program 1 times [2021-08-12 20:55:38,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:55:38,544 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615270752] [2021-08-12 20:55:38,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:55:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:55:38,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:38,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:38,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:38,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:55:38,584 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:55:38,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:55:38,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:38,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:55:38,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:38,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:55:38,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:38,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:55:38,608 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:55:38,608 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615270752] [2021-08-12 20:55:38,610 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615270752] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:55:38,610 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:55:38,610 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 20:55:38,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157081671] [2021-08-12 20:55:38,611 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 20:55:38,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:55:38,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 20:55:38,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 20:55:38,612 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 125 [2021-08-12 20:55:38,612 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 365 transitions, 2732 flow. Second operand has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 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-08-12 20:55:38,612 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:55:38,612 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 125 [2021-08-12 20:55:38,612 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:55:39,271 INFO L129 PetriNetUnfolder]: 1834/5908 cut-off events. [2021-08-12 20:55:39,271 INFO L130 PetriNetUnfolder]: For 2763/3996 co-relation queries the response was YES. [2021-08-12 20:55:39,294 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18119 conditions, 5908 events. 1834/5908 cut-off events. For 2763/3996 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 62902 event pairs, 107 based on Foata normal form. 5/5495 useless extension candidates. Maximal degree in co-relation 18030. Up to 1252 conditions per place. [2021-08-12 20:55:39,306 INFO L132 encePairwiseOnDemand]: 119/125 looper letters, 27 selfloop transitions, 11 changer transitions 213/455 dead transitions. [2021-08-12 20:55:39,307 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 455 transitions, 4152 flow [2021-08-12 20:55:39,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 20:55:39,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-12 20:55:39,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1038 transitions. [2021-08-12 20:55:39,309 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9226666666666666 [2021-08-12 20:55:39,309 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1038 transitions. [2021-08-12 20:55:39,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1038 transitions. [2021-08-12 20:55:39,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:55:39,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1038 transitions. [2021-08-12 20:55:39,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 115.33333333333333) internal successors, (1038), 9 states have internal predecessors, (1038), 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-08-12 20:55:39,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 125.0) internal successors, (1250), 10 states have internal predecessors, (1250), 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-08-12 20:55:39,314 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 125.0) internal successors, (1250), 10 states have internal predecessors, (1250), 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-08-12 20:55:39,314 INFO L348 CegarLoopForPetriNet]: 132 programPoint places, 96 predicate places. [2021-08-12 20:55:39,314 INFO L482 AbstractCegarLoop]: Abstraction has has 228 places, 455 transitions, 4152 flow [2021-08-12 20:55:39,314 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 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-08-12 20:55:39,314 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:55:39,314 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:55:39,315 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-12 20:55:39,315 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:55:39,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:55:39,315 INFO L82 PathProgramCache]: Analyzing trace with hash -646461372, now seen corresponding path program 1 times [2021-08-12 20:55:39,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:55:39,315 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989418178] [2021-08-12 20:55:39,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:55:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:55:39,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:39,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:39,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:39,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:55:39,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:39,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:55:39,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:39,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:55:39,376 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 20:55:39,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 20:55:39,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:39,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:55:39,395 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 20:55:39,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:55:39,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:39,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:55:39,403 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:55:39,403 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989418178] [2021-08-12 20:55:39,403 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989418178] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:55:39,403 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:55:39,403 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-12 20:55:39,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353128818] [2021-08-12 20:55:39,403 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-12 20:55:39,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:55:39,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-12 20:55:39,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-12 20:55:39,404 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 125 [2021-08-12 20:55:39,405 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 455 transitions, 4152 flow. Second operand has 8 states, 8 states have (on average 111.125) internal successors, (889), 8 states have internal predecessors, (889), 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-08-12 20:55:39,405 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:55:39,405 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 125 [2021-08-12 20:55:39,405 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:55:39,885 INFO L129 PetriNetUnfolder]: 1161/2863 cut-off events. [2021-08-12 20:55:39,886 INFO L130 PetriNetUnfolder]: For 798/3479 co-relation queries the response was YES. [2021-08-12 20:55:39,897 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9638 conditions, 2863 events. 1161/2863 cut-off events. For 798/3479 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 23477 event pairs, 11 based on Foata normal form. 105/2638 useless extension candidates. Maximal degree in co-relation 9546. Up to 879 conditions per place. [2021-08-12 20:55:39,905 INFO L132 encePairwiseOnDemand]: 114/125 looper letters, 33 selfloop transitions, 88 changer transitions 99/338 dead transitions. [2021-08-12 20:55:39,905 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 338 transitions, 2504 flow [2021-08-12 20:55:39,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-12 20:55:39,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-12 20:55:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1845 transitions. [2021-08-12 20:55:39,908 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9225 [2021-08-12 20:55:39,908 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1845 transitions. [2021-08-12 20:55:39,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1845 transitions. [2021-08-12 20:55:39,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:55:39,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1845 transitions. [2021-08-12 20:55:39,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 115.3125) internal successors, (1845), 16 states have internal predecessors, (1845), 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-08-12 20:55:39,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 125.0) internal successors, (2125), 17 states have internal predecessors, (2125), 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-08-12 20:55:39,915 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 125.0) internal successors, (2125), 17 states have internal predecessors, (2125), 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-08-12 20:55:39,915 INFO L348 CegarLoopForPetriNet]: 132 programPoint places, 75 predicate places. [2021-08-12 20:55:39,915 INFO L482 AbstractCegarLoop]: Abstraction has has 207 places, 338 transitions, 2504 flow [2021-08-12 20:55:39,925 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 111.125) internal successors, (889), 8 states have internal predecessors, (889), 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-08-12 20:55:39,925 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:55:39,925 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:55:39,925 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-12 20:55:39,925 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:55:39,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:55:39,925 INFO L82 PathProgramCache]: Analyzing trace with hash 147618660, now seen corresponding path program 1 times [2021-08-12 20:55:39,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:55:39,926 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101081894] [2021-08-12 20:55:39,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:55:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:55:39,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:39,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:39,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:39,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:55:39,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:39,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:55:39,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:39,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:55:39,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:39,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:55:39,994 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 20:55:39,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 20:55:40,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:40,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:55:40,030 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 20:55:40,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:55:40,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:40,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:55:40,039 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:55:40,039 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101081894] [2021-08-12 20:55:40,039 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101081894] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:55:40,039 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:55:40,039 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-12 20:55:40,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328085441] [2021-08-12 20:55:40,040 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-12 20:55:40,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:55:40,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-12 20:55:40,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-12 20:55:40,041 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 125 [2021-08-12 20:55:40,042 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 338 transitions, 2504 flow. Second operand has 9 states, 9 states have (on average 111.11111111111111) internal successors, (1000), 9 states have internal predecessors, (1000), 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-08-12 20:55:40,042 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:55:40,042 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 125 [2021-08-12 20:55:40,042 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:55:40,626 INFO L129 PetriNetUnfolder]: 1083/2365 cut-off events. [2021-08-12 20:55:40,626 INFO L130 PetriNetUnfolder]: For 678/3867 co-relation queries the response was YES. [2021-08-12 20:55:40,636 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9694 conditions, 2365 events. 1083/2365 cut-off events. For 678/3867 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 18870 event pairs, 0 based on Foata normal form. 119/2177 useless extension candidates. Maximal degree in co-relation 9599. Up to 850 conditions per place. [2021-08-12 20:55:40,644 INFO L132 encePairwiseOnDemand]: 114/125 looper letters, 28 selfloop transitions, 93 changer transitions 108/330 dead transitions. [2021-08-12 20:55:40,644 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 330 transitions, 2676 flow [2021-08-12 20:55:40,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-12 20:55:40,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-08-12 20:55:40,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2172 transitions. [2021-08-12 20:55:40,647 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9145263157894736 [2021-08-12 20:55:40,647 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2172 transitions. [2021-08-12 20:55:40,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2172 transitions. [2021-08-12 20:55:40,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:55:40,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2172 transitions. [2021-08-12 20:55:40,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 114.3157894736842) internal successors, (2172), 19 states have internal predecessors, (2172), 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-08-12 20:55:40,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 125.0) internal successors, (2500), 20 states have internal predecessors, (2500), 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-08-12 20:55:40,654 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 125.0) internal successors, (2500), 20 states have internal predecessors, (2500), 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-08-12 20:55:40,654 INFO L348 CegarLoopForPetriNet]: 132 programPoint places, 84 predicate places. [2021-08-12 20:55:40,654 INFO L482 AbstractCegarLoop]: Abstraction has has 216 places, 330 transitions, 2676 flow [2021-08-12 20:55:40,654 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 111.11111111111111) internal successors, (1000), 9 states have internal predecessors, (1000), 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-08-12 20:55:40,654 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:55:40,655 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-12 20:55:40,655 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-12 20:55:40,655 INFO L430 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:55:40,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:55:40,655 INFO L82 PathProgramCache]: Analyzing trace with hash 2006528140, now seen corresponding path program 1 times [2021-08-12 20:55:40,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:55:40,655 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145470263] [2021-08-12 20:55:40,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:55:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:55:40,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:40,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:40,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:40,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:55:40,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:40,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:55:40,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:40,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 20:55:40,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:40,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-12 20:55:40,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:40,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-08-12 20:55:40,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:40,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-08-12 20:55:40,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:40,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-08-12 20:55:40,761 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:55:40,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:55:40,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:40,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:55:40,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:40,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:55:40,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:40,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:40,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:55:40,797 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:55:40,797 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145470263] [2021-08-12 20:55:40,797 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145470263] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:55:40,797 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:55:40,797 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-12 20:55:40,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962773658] [2021-08-12 20:55:40,797 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-12 20:55:40,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:55:40,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-12 20:55:40,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-08-12 20:55:40,798 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 125 [2021-08-12 20:55:40,799 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 330 transitions, 2676 flow. Second operand has 12 states, 12 states have (on average 102.58333333333333) internal successors, (1231), 12 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:55:40,799 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:55:40,799 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 125 [2021-08-12 20:55:40,799 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:55:41,486 INFO L129 PetriNetUnfolder]: 2755/6201 cut-off events. [2021-08-12 20:55:41,486 INFO L130 PetriNetUnfolder]: For 4242/15584 co-relation queries the response was YES. [2021-08-12 20:55:41,532 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25300 conditions, 6201 events. 2755/6201 cut-off events. For 4242/15584 co-relation queries the response was YES. Maximal size of possible extension queue 986. Compared 61772 event pairs, 0 based on Foata normal form. 25/5554 useless extension candidates. Maximal degree in co-relation 25197. Up to 2142 conditions per place. [2021-08-12 20:55:41,563 INFO L132 encePairwiseOnDemand]: 114/125 looper letters, 25 selfloop transitions, 17 changer transitions 101/358 dead transitions. [2021-08-12 20:55:41,563 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 358 transitions, 3098 flow [2021-08-12 20:55:41,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-12 20:55:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-08-12 20:55:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1458 transitions. [2021-08-12 20:55:41,565 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8331428571428572 [2021-08-12 20:55:41,565 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1458 transitions. [2021-08-12 20:55:41,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1458 transitions. [2021-08-12 20:55:41,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:55:41,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1458 transitions. [2021-08-12 20:55:41,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 104.14285714285714) internal successors, (1458), 14 states have internal predecessors, (1458), 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-08-12 20:55:41,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 125.0) internal successors, (1875), 15 states have internal predecessors, (1875), 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-08-12 20:55:41,570 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 125.0) internal successors, (1875), 15 states have internal predecessors, (1875), 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-08-12 20:55:41,570 INFO L348 CegarLoopForPetriNet]: 132 programPoint places, 97 predicate places. [2021-08-12 20:55:41,570 INFO L482 AbstractCegarLoop]: Abstraction has has 229 places, 358 transitions, 3098 flow [2021-08-12 20:55:41,570 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 102.58333333333333) internal successors, (1231), 12 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:55:41,570 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:55:41,571 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-12 20:55:41,571 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-12 20:55:41,571 INFO L430 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:55:41,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:55:41,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1024908900, now seen corresponding path program 2 times [2021-08-12 20:55:41,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:55:41,571 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764186366] [2021-08-12 20:55:41,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:55:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:55:41,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:41,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:41,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:41,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:55:41,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:41,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:55:41,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:41,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 20:55:41,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:41,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-12 20:55:41,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:41,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-08-12 20:55:41,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:41,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-08-12 20:55:41,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:41,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-08-12 20:55:41,704 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:55:41,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:55:41,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:41,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:55:41,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:41,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:55:41,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:41,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:55:41,740 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:55:41,740 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764186366] [2021-08-12 20:55:41,740 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764186366] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:55:41,740 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:55:41,740 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-12 20:55:41,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265805157] [2021-08-12 20:55:41,740 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-12 20:55:41,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:55:41,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-12 20:55:41,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-08-12 20:55:41,742 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 125 [2021-08-12 20:55:41,743 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 358 transitions, 3098 flow. Second operand has 12 states, 12 states have (on average 102.58333333333333) internal successors, (1231), 12 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:55:41,743 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:55:41,743 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 125 [2021-08-12 20:55:41,743 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:55:43,719 INFO L129 PetriNetUnfolder]: 6404/14599 cut-off events. [2021-08-12 20:55:43,719 INFO L130 PetriNetUnfolder]: For 12159/35743 co-relation queries the response was YES. [2021-08-12 20:55:43,790 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60284 conditions, 14599 events. 6404/14599 cut-off events. For 12159/35743 co-relation queries the response was YES. Maximal size of possible extension queue 2320. Compared 171293 event pairs, 0 based on Foata normal form. 39/13370 useless extension candidates. Maximal degree in co-relation 60173. Up to 4962 conditions per place. [2021-08-12 20:55:43,803 INFO L132 encePairwiseOnDemand]: 114/125 looper letters, 18 selfloop transitions, 5 changer transitions 201/421 dead transitions. [2021-08-12 20:55:43,803 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 421 transitions, 4218 flow [2021-08-12 20:55:43,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-12 20:55:43,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-08-12 20:55:43,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1254 transitions. [2021-08-12 20:55:43,805 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.836 [2021-08-12 20:55:43,805 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1254 transitions. [2021-08-12 20:55:43,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1254 transitions. [2021-08-12 20:55:43,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:55:43,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1254 transitions. [2021-08-12 20:55:43,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 104.5) internal successors, (1254), 12 states have internal predecessors, (1254), 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-08-12 20:55:43,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 125.0) internal successors, (1625), 13 states have internal predecessors, (1625), 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-08-12 20:55:43,809 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 125.0) internal successors, (1625), 13 states have internal predecessors, (1625), 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-08-12 20:55:43,809 INFO L348 CegarLoopForPetriNet]: 132 programPoint places, 108 predicate places. [2021-08-12 20:55:43,809 INFO L482 AbstractCegarLoop]: Abstraction has has 240 places, 421 transitions, 4218 flow [2021-08-12 20:55:43,809 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 102.58333333333333) internal successors, (1231), 12 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:55:43,809 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:55:43,809 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-12 20:55:43,809 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-12 20:55:43,809 INFO L430 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:55:43,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:55:43,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1391153946, now seen corresponding path program 3 times [2021-08-12 20:55:43,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:55:43,810 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593902280] [2021-08-12 20:55:43,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:55:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:55:43,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:43,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:43,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:43,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:55:43,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:43,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:55:43,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:43,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 20:55:43,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:43,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-08-12 20:55:43,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:43,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-08-12 20:55:44,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:44,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-08-12 20:55:44,141 INFO L142 QuantifierPusher]: treesize reduction 26, result has 57.4 percent of original size [2021-08-12 20:55:44,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-08-12 20:55:44,159 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:55:44,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:55:44,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:44,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:55:44,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:44,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:55:44,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:55:44,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:55:44,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:55:44,196 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:55:44,196 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593902280] [2021-08-12 20:55:44,196 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593902280] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:55:44,196 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:55:44,196 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-12 20:55:44,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938829201] [2021-08-12 20:55:44,197 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-12 20:55:44,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:55:44,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-12 20:55:44,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-08-12 20:55:44,198 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 125 [2021-08-12 20:55:44,199 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 421 transitions, 4218 flow. Second operand has 12 states, 12 states have (on average 104.41666666666667) internal successors, (1253), 12 states have internal predecessors, (1253), 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-08-12 20:55:44,199 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:55:44,199 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 125 [2021-08-12 20:55:44,199 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:55:47,185 INFO L129 PetriNetUnfolder]: 10396/23215 cut-off events. [2021-08-12 20:55:47,186 INFO L130 PetriNetUnfolder]: For 20067/58406 co-relation queries the response was YES. [2021-08-12 20:55:47,335 INFO L84 FinitePrefix]: Finished finitePrefix Result has 96562 conditions, 23215 events. 10396/23215 cut-off events. For 20067/58406 co-relation queries the response was YES. Maximal size of possible extension queue 3569. Compared 286390 event pairs, 6 based on Foata normal form. 54/21293 useless extension candidates. Maximal degree in co-relation 96443. Up to 8081 conditions per place. [2021-08-12 20:55:47,354 INFO L132 encePairwiseOnDemand]: 115/125 looper letters, 14 selfloop transitions, 6 changer transitions 260/477 dead transitions. [2021-08-12 20:55:47,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 477 transitions, 5548 flow [2021-08-12 20:55:47,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-12 20:55:47,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-12 20:55:47,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1059 transitions. [2021-08-12 20:55:47,356 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8472 [2021-08-12 20:55:47,356 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1059 transitions. [2021-08-12 20:55:47,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1059 transitions. [2021-08-12 20:55:47,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:55:47,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1059 transitions. [2021-08-12 20:55:47,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 105.9) internal successors, (1059), 10 states have internal predecessors, (1059), 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-08-12 20:55:47,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 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-08-12 20:55:47,359 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 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-08-12 20:55:47,360 INFO L348 CegarLoopForPetriNet]: 132 programPoint places, 117 predicate places. [2021-08-12 20:55:47,360 INFO L482 AbstractCegarLoop]: Abstraction has has 249 places, 477 transitions, 5548 flow [2021-08-12 20:55:47,360 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 104.41666666666667) internal successors, (1253), 12 states have internal predecessors, (1253), 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-08-12 20:55:47,360 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:55:47,360 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-12 20:55:47,360 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-12 20:55:47,360 INFO L430 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:55:47,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:55:47,361 INFO L82 PathProgramCache]: Analyzing trace with hash 416983152, now seen corresponding path program 4 times [2021-08-12 20:55:47,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:55:47,361 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024517229] [2021-08-12 20:55:47,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:55:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 20:55:47,383 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 20:55:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 20:55:47,410 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 20:55:47,440 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-12 20:55:47,440 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-12 20:55:47,440 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-12 20:55:47,442 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-12 20:55:47,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.08 08:55:47 BasicIcfg [2021-08-12 20:55:47,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-12 20:55:47,674 INFO L168 Benchmark]: Toolchain (without parser) took 19247.54 ms. Allocated memory was 175.1 MB in the beginning and 4.7 GB in the end (delta: 4.5 GB). Free memory was 137.5 MB in the beginning and 4.0 GB in the end (delta: -3.9 GB). Peak memory consumption was 823.0 MB. Max. memory is 8.0 GB. [2021-08-12 20:55:47,675 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 175.1 MB. Free memory was 155.6 MB in the beginning and 155.4 MB in the end (delta: 160.9 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-08-12 20:55:47,675 INFO L168 Benchmark]: CACSL2BoogieTranslator took 539.94 ms. Allocated memory is still 175.1 MB. Free memory was 137.2 MB in the beginning and 133.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 3.6 MB. Max. memory is 8.0 GB. [2021-08-12 20:55:47,675 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.37 ms. Allocated memory is still 175.1 MB. Free memory was 133.0 MB in the beginning and 129.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-12 20:55:47,675 INFO L168 Benchmark]: Boogie Preprocessor took 46.54 ms. Allocated memory is still 175.1 MB. Free memory was 129.8 MB in the beginning and 127.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-12 20:55:47,675 INFO L168 Benchmark]: RCFGBuilder took 1577.32 ms. Allocated memory was 175.1 MB in the beginning and 212.9 MB in the end (delta: 37.7 MB). Free memory was 127.7 MB in the beginning and 182.1 MB in the end (delta: -54.4 MB). Peak memory consumption was 77.7 MB. Max. memory is 8.0 GB. [2021-08-12 20:55:47,675 INFO L168 Benchmark]: TraceAbstraction took 17012.78 ms. Allocated memory was 212.9 MB in the beginning and 4.7 GB in the end (delta: 4.5 GB). Free memory was 181.6 MB in the beginning and 4.0 GB in the end (delta: -3.9 GB). Peak memory consumption was 827.7 MB. Max. memory is 8.0 GB. [2021-08-12 20:55:47,676 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.14 ms. Allocated memory is still 175.1 MB. Free memory was 155.6 MB in the beginning and 155.4 MB in the end (delta: 160.9 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 539.94 ms. Allocated memory is still 175.1 MB. Free memory was 137.2 MB in the beginning and 133.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 3.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 65.37 ms. Allocated memory is still 175.1 MB. Free memory was 133.0 MB in the beginning and 129.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 46.54 ms. Allocated memory is still 175.1 MB. Free memory was 129.8 MB in the beginning and 127.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1577.32 ms. Allocated memory was 175.1 MB in the beginning and 212.9 MB in the end (delta: 37.7 MB). Free memory was 127.7 MB in the beginning and 182.1 MB in the end (delta: -54.4 MB). Peak memory consumption was 77.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 17012.78 ms. Allocated memory was 212.9 MB in the beginning and 4.7 GB in the end (delta: 4.5 GB). Free memory was 181.6 MB in the beginning and 4.0 GB in the end (delta: -3.9 GB). Peak memory consumption was 827.7 MB. Max. memory is 8.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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L724] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L725] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L726] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L727] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L728] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L729] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L730] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L731] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L732] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L733] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L734] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L735] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L736] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L737] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L738] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L739] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L740] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L741] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L742] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1461; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1462; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1463; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t1463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t1464; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] FCALL, FORK 0 pthread_create(&t1464, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L814] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L816] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L818] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L784] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 159 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 19.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 16652.0ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 13865.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 75.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 175 SDtfs, 641 SDslu, 674 SDs, 0 SdLazy, 1032 SolverSat, 280 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 873.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 2288.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5548occurred in iteration=14, InterpolantAutomatonStates: 178, 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: 54.8ms SsaConstructionTime, 501.8ms SatisfiabilityAnalysisTime, 1844.4ms InterpolantComputationTime, 1291 NumberOfCodeBlocks, 1291 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1181 ConstructedInterpolants, 0 QuantifiedInterpolants, 6037 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...