/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 20:14:12,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 20:14:12,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 20:14:12,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 20:14:12,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 20:14:12,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 20:14:12,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 20:14:12,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 20:14:12,216 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 20:14:12,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 20:14:12,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 20:14:12,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 20:14:12,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 20:14:12,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 20:14:12,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 20:14:12,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 20:14:12,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 20:14:12,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 20:14:12,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 20:14:12,234 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 20:14:12,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 20:14:12,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 20:14:12,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 20:14:12,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 20:14:12,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 20:14:12,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 20:14:12,241 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 20:14:12,242 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 20:14:12,242 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 20:14:12,243 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 20:14:12,243 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 20:14:12,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 20:14:12,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 20:14:12,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 20:14:12,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 20:14:12,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 20:14:12,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 20:14:12,245 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 20:14:12,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 20:14:12,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 20:14:12,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 20:14:12,248 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2021-03-11 20:14:12,272 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 20:14:12,272 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 20:14:12,274 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 20:14:12,274 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 20:14:12,274 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 20:14:12,274 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 20:14:12,275 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 20:14:12,275 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 20:14:12,275 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 20:14:12,275 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 20:14:12,275 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 20:14:12,276 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 20:14:12,276 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 20:14:12,276 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 20:14:12,276 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 20:14:12,276 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 20:14:12,276 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 20:14:12,276 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 20:14:12,276 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 20:14:12,276 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 20:14:12,276 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 20:14:12,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:14:12,277 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 20:14:12,277 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 20:14:12,277 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 20:14:12,277 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 20:14:12,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 20:14:12,277 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 20:14:12,277 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-11 20:14:12,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 20:14:12,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 20:14:12,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 20:14:12,532 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 20:14:12,532 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 20:14:12,533 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_rmo.oepc.i [2021-03-11 20:14:12,586 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a8a011a1/b23919c2f74649649e1680994d799205/FLAGdd6e60911 [2021-03-11 20:14:13,014 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 20:14:13,014 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_rmo.oepc.i [2021-03-11 20:14:13,033 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a8a011a1/b23919c2f74649649e1680994d799205/FLAGdd6e60911 [2021-03-11 20:14:13,340 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a8a011a1/b23919c2f74649649e1680994d799205 [2021-03-11 20:14:13,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 20:14:13,346 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 20:14:13,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 20:14:13,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 20:14:13,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 20:14:13,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:14:13" (1/1) ... [2021-03-11 20:14:13,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aae2ffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:14:13, skipping insertion in model container [2021-03-11 20:14:13,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:14:13" (1/1) ... [2021-03-11 20:14:13,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 20:14:13,400 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 20:14:13,496 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_rmo.oepc.i[949,962] [2021-03-11 20:14:13,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:14:13,634 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 20:14:13,641 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_rmo.oepc.i[949,962] [2021-03-11 20:14:13,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:14:13,713 INFO L208 MainTranslator]: Completed translation [2021-03-11 20:14:13,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:14:13 WrapperNode [2021-03-11 20:14:13,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 20:14:13,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 20:14:13,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 20:14:13,714 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 20:14:13,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:14:13" (1/1) ... [2021-03-11 20:14:13,728 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:14:13" (1/1) ... [2021-03-11 20:14:13,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 20:14:13,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 20:14:13,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 20:14:13,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 20:14:13,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:14:13" (1/1) ... [2021-03-11 20:14:13,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:14:13" (1/1) ... [2021-03-11 20:14:13,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:14:13" (1/1) ... [2021-03-11 20:14:13,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:14:13" (1/1) ... [2021-03-11 20:14:13,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:14:13" (1/1) ... [2021-03-11 20:14:13,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:14:13" (1/1) ... [2021-03-11 20:14:13,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:14:13" (1/1) ... [2021-03-11 20:14:13,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 20:14:13,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 20:14:13,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 20:14:13,765 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 20:14:13,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:14:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:14:13,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 20:14:13,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 20:14:13,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 20:14:13,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 20:14:13,818 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 20:14:13,819 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 20:14:13,819 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 20:14:13,819 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 20:14:13,819 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 20:14:13,819 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 20:14:13,819 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-11 20:14:13,819 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-11 20:14:13,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 20:14:13,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 20:14:13,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 20:14:13,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 20:14:13,820 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 20:14:15,214 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 20:14:15,215 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 20:14:15,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:14:15 BoogieIcfgContainer [2021-03-11 20:14:15,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 20:14:15,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 20:14:15,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 20:14:15,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 20:14:15,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:14:13" (1/3) ... [2021-03-11 20:14:15,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12711be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:14:15, skipping insertion in model container [2021-03-11 20:14:15,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:14:13" (2/3) ... [2021-03-11 20:14:15,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12711be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:14:15, skipping insertion in model container [2021-03-11 20:14:15,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:14:15" (3/3) ... [2021-03-11 20:14:15,220 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_rmo.oepc.i [2021-03-11 20:14:15,224 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 20:14:15,227 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 20:14:15,227 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 20:14:15,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,253 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,253 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,253 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,253 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,253 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,253 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,254 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,254 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,256 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,256 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,256 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,256 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,259 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,259 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,259 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,259 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,261 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,261 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,261 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,261 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,261 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,261 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,261 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,261 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,261 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,264 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,264 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,264 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,264 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,264 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,264 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,265 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,265 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,265 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,265 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,265 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,265 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,265 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,269 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,269 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,269 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,269 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,269 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,269 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,269 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,269 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,269 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,269 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,270 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,270 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,270 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,270 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,270 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,270 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,270 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,270 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,272 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,272 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,272 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,273 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,274 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,275 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,275 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,276 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,276 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,276 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,277 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,279 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,279 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,279 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:15,279 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 20:14:15,290 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-11 20:14:15,302 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 20:14:15,302 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 20:14:15,302 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 20:14:15,302 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 20:14:15,302 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 20:14:15,302 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 20:14:15,303 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 20:14:15,303 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 20:14:15,309 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 250 flow [2021-03-11 20:14:15,334 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-03-11 20:14:15,334 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:14:15,337 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 86 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-11 20:14:15,337 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 115 transitions, 250 flow [2021-03-11 20:14:15,340 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 111 transitions, 234 flow [2021-03-11 20:14:15,342 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 20:14:15,347 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 234 flow [2021-03-11 20:14:15,349 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 111 transitions, 234 flow [2021-03-11 20:14:15,349 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 234 flow [2021-03-11 20:14:15,363 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-03-11 20:14:15,363 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:14:15,364 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 86 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-11 20:14:15,366 INFO L116 LiptonReduction]: Number of co-enabled transitions 2672 [2021-03-11 20:14:16,072 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-11 20:14:16,416 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-11 20:14:16,544 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-11 20:14:19,461 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-11 20:14:19,582 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-11 20:14:19,899 WARN L205 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-11 20:14:20,040 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-11 20:14:20,044 INFO L131 LiptonReduction]: Checked pairs total: 7058 [2021-03-11 20:14:20,044 INFO L133 LiptonReduction]: Total number of compositions: 93 [2021-03-11 20:14:20,045 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4705 [2021-03-11 20:14:20,049 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-03-11 20:14:20,049 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:14:20,050 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:20,050 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-03-11 20:14:20,050 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:20,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:20,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1205359, now seen corresponding path program 1 times [2021-03-11 20:14:20,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:20,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291224699] [2021-03-11 20:14:20,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:20,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:20,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:20,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-03-11 20:14:20,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291224699] [2021-03-11 20:14:20,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:20,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:14:20,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79433146] [2021-03-11 20:14:20,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:14:20,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:20,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:14:20,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:14:20,212 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 208 [2021-03-11 20:14:20,213 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:20,214 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:20,214 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 208 [2021-03-11 20:14:20,214 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:20,323 INFO L129 PetriNetUnfolder]: 133/301 cut-off events. [2021-03-11 20:14:20,323 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:14:20,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 301 events. 133/301 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1539 event pairs, 110 based on Foata normal form. 0/275 useless extension candidates. Maximal degree in co-relation 509. Up to 153 conditions per place. [2021-03-11 20:14:20,327 INFO L132 encePairwiseOnDemand]: 205/208 looper letters, 11 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2021-03-11 20:14:20,327 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 33 transitions, 104 flow [2021-03-11 20:14:20,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:14:20,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:14:20,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2021-03-11 20:14:20,340 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8878205128205128 [2021-03-11 20:14:20,341 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 554 transitions. [2021-03-11 20:14:20,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 554 transitions. [2021-03-11 20:14:20,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:20,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 554 transitions. [2021-03-11 20:14:20,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:20,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:20,354 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:20,355 INFO L185 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 554 transitions. [2021-03-11 20:14:20,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 33 transitions, 104 flow [2021-03-11 20:14:20,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 100 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-11 20:14:20,358 INFO L241 Difference]: Finished difference. Result has 39 places, 28 transitions, 68 flow [2021-03-11 20:14:20,361 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2021-03-11 20:14:20,361 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2021-03-11 20:14:20,361 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2021-03-11 20:14:20,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:20,362 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:20,362 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:20,362 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 20:14:20,363 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:20,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:20,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1792414243, now seen corresponding path program 1 times [2021-03-11 20:14:20,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:20,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293508083] [2021-03-11 20:14:20,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:20,458 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-11 20:14:20,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 20:14:20,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:20,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293508083] [2021-03-11 20:14:20,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:20,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:14:20,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793520113] [2021-03-11 20:14:20,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:14:20,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:20,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:14:20,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:14:20,468 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 208 [2021-03-11 20:14:20,468 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:20,468 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:20,468 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 208 [2021-03-11 20:14:20,468 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:20,558 INFO L129 PetriNetUnfolder]: 313/770 cut-off events. [2021-03-11 20:14:20,558 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:14:20,561 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1280 conditions, 770 events. 313/770 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5385 event pairs, 107 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 1271. Up to 269 conditions per place. [2021-03-11 20:14:20,563 INFO L132 encePairwiseOnDemand]: 199/208 looper letters, 7 selfloop transitions, 7 changer transitions 2/35 dead transitions. [2021-03-11 20:14:20,563 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 114 flow [2021-03-11 20:14:20,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:14:20,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:14:20,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2021-03-11 20:14:20,566 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8349358974358975 [2021-03-11 20:14:20,566 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 521 transitions. [2021-03-11 20:14:20,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 521 transitions. [2021-03-11 20:14:20,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:20,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 521 transitions. [2021-03-11 20:14:20,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:20,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:20,569 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:20,569 INFO L185 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 3 states and 521 transitions. [2021-03-11 20:14:20,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 114 flow [2021-03-11 20:14:20,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:14:20,570 INFO L241 Difference]: Finished difference. Result has 41 places, 33 transitions, 116 flow [2021-03-11 20:14:20,570 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2021-03-11 20:14:20,570 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2021-03-11 20:14:20,570 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 116 flow [2021-03-11 20:14:20,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:20,571 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:20,571 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:20,571 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 20:14:20,571 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:20,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:20,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1986621862, now seen corresponding path program 1 times [2021-03-11 20:14:20,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:20,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458023892] [2021-03-11 20:14:20,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:20,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:20,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:20,644 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-11 20:14:20,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 20:14:20,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:20,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458023892] [2021-03-11 20:14:20,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:20,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:14:20,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991991548] [2021-03-11 20:14:20,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:14:20,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:20,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:14:20,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:14:20,653 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 208 [2021-03-11 20:14:20,654 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:20,654 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:20,654 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 208 [2021-03-11 20:14:20,654 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:20,726 INFO L129 PetriNetUnfolder]: 147/416 cut-off events. [2021-03-11 20:14:20,726 INFO L130 PetriNetUnfolder]: For 94/353 co-relation queries the response was YES. [2021-03-11 20:14:20,727 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 416 events. 147/416 cut-off events. For 94/353 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2521 event pairs, 12 based on Foata normal form. 3/405 useless extension candidates. Maximal degree in co-relation 1048. Up to 165 conditions per place. [2021-03-11 20:14:20,729 INFO L132 encePairwiseOnDemand]: 200/208 looper letters, 12 selfloop transitions, 11 changer transitions 0/42 dead transitions. [2021-03-11 20:14:20,729 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 208 flow [2021-03-11 20:14:20,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 20:14:20,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 20:14:20,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 692 transitions. [2021-03-11 20:14:20,731 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8317307692307693 [2021-03-11 20:14:20,731 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 692 transitions. [2021-03-11 20:14:20,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 692 transitions. [2021-03-11 20:14:20,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:20,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 692 transitions. [2021-03-11 20:14:20,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:20,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:20,734 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:20,734 INFO L185 Difference]: Start difference. First operand has 41 places, 33 transitions, 116 flow. Second operand 4 states and 692 transitions. [2021-03-11 20:14:20,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 208 flow [2021-03-11 20:14:20,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:14:20,737 INFO L241 Difference]: Finished difference. Result has 44 places, 40 transitions, 186 flow [2021-03-11 20:14:20,738 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2021-03-11 20:14:20,738 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2021-03-11 20:14:20,738 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 186 flow [2021-03-11 20:14:20,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:20,738 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:20,738 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:20,738 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 20:14:20,739 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:20,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:20,739 INFO L82 PathProgramCache]: Analyzing trace with hash -269734341, now seen corresponding path program 1 times [2021-03-11 20:14:20,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:20,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175050012] [2021-03-11 20:14:20,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:20,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:20,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:20,793 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-11 20:14:20,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 20:14:20,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:20,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175050012] [2021-03-11 20:14:20,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:20,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:14:20,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595859077] [2021-03-11 20:14:20,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:14:20,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:20,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:14:20,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:14:20,802 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 208 [2021-03-11 20:14:20,803 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:20,803 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:20,803 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 208 [2021-03-11 20:14:20,803 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:20,858 INFO L129 PetriNetUnfolder]: 129/392 cut-off events. [2021-03-11 20:14:20,858 INFO L130 PetriNetUnfolder]: For 312/670 co-relation queries the response was YES. [2021-03-11 20:14:20,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 392 events. 129/392 cut-off events. For 312/670 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2474 event pairs, 26 based on Foata normal form. 15/397 useless extension candidates. Maximal degree in co-relation 1121. Up to 149 conditions per place. [2021-03-11 20:14:20,862 INFO L132 encePairwiseOnDemand]: 200/208 looper letters, 15 selfloop transitions, 17 changer transitions 0/51 dead transitions. [2021-03-11 20:14:20,862 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 51 transitions, 324 flow [2021-03-11 20:14:20,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 20:14:20,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 20:14:20,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 692 transitions. [2021-03-11 20:14:20,864 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8317307692307693 [2021-03-11 20:14:20,864 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 692 transitions. [2021-03-11 20:14:20,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 692 transitions. [2021-03-11 20:14:20,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:20,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 692 transitions. [2021-03-11 20:14:20,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:20,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:20,868 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:20,868 INFO L185 Difference]: Start difference. First operand has 44 places, 40 transitions, 186 flow. Second operand 4 states and 692 transitions. [2021-03-11 20:14:20,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 51 transitions, 324 flow [2021-03-11 20:14:20,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 51 transitions, 324 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-11 20:14:20,875 INFO L241 Difference]: Finished difference. Result has 50 places, 49 transitions, 330 flow [2021-03-11 20:14:20,877 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=330, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2021-03-11 20:14:20,877 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2021-03-11 20:14:20,877 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 330 flow [2021-03-11 20:14:20,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:20,878 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:20,878 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:20,878 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 20:14:20,878 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:20,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:20,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1453777832, now seen corresponding path program 1 times [2021-03-11 20:14:20,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:20,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101439921] [2021-03-11 20:14:20,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:20,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:20,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:20,926 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 20:14:20,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:14:20,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:20,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:14:20,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:20,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101439921] [2021-03-11 20:14:20,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:20,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:14:20,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268761096] [2021-03-11 20:14:20,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:14:20,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:20,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:14:20,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:14:20,934 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 208 [2021-03-11 20:14:20,935 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 330 flow. Second operand has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:20,935 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:20,935 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 208 [2021-03-11 20:14:20,935 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:21,092 INFO L129 PetriNetUnfolder]: 755/1561 cut-off events. [2021-03-11 20:14:21,092 INFO L130 PetriNetUnfolder]: For 1123/1249 co-relation queries the response was YES. [2021-03-11 20:14:21,097 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3813 conditions, 1561 events. 755/1561 cut-off events. For 1123/1249 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 12079 event pairs, 314 based on Foata normal form. 125/1544 useless extension candidates. Maximal degree in co-relation 3794. Up to 875 conditions per place. [2021-03-11 20:14:21,102 INFO L132 encePairwiseOnDemand]: 201/208 looper letters, 10 selfloop transitions, 10 changer transitions 0/62 dead transitions. [2021-03-11 20:14:21,102 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 62 transitions, 396 flow [2021-03-11 20:14:21,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:14:21,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:14:21,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 872 transitions. [2021-03-11 20:14:21,104 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8384615384615385 [2021-03-11 20:14:21,104 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 872 transitions. [2021-03-11 20:14:21,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 872 transitions. [2021-03-11 20:14:21,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:21,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 872 transitions. [2021-03-11 20:14:21,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 174.4) internal successors, (872), 5 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:21,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:21,108 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:21,108 INFO L185 Difference]: Start difference. First operand has 50 places, 49 transitions, 330 flow. Second operand 5 states and 872 transitions. [2021-03-11 20:14:21,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 62 transitions, 396 flow [2021-03-11 20:14:21,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 62 transitions, 396 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-11 20:14:21,113 INFO L241 Difference]: Finished difference. Result has 57 places, 58 transitions, 405 flow [2021-03-11 20:14:21,114 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=405, PETRI_PLACES=57, PETRI_TRANSITIONS=58} [2021-03-11 20:14:21,114 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2021-03-11 20:14:21,114 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 58 transitions, 405 flow [2021-03-11 20:14:21,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:21,115 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:21,115 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:21,115 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 20:14:21,115 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:21,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:21,115 INFO L82 PathProgramCache]: Analyzing trace with hash -227726896, now seen corresponding path program 1 times [2021-03-11 20:14:21,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:21,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960752670] [2021-03-11 20:14:21,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:21,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:21,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:14:21,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:21,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:21,157 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-11 20:14:21,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 20:14:21,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:21,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960752670] [2021-03-11 20:14:21,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:21,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:14:21,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758388486] [2021-03-11 20:14:21,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:14:21,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:21,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:14:21,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:14:21,169 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 208 [2021-03-11 20:14:21,170 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 58 transitions, 405 flow. Second operand has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:21,170 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:21,170 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 208 [2021-03-11 20:14:21,170 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:21,352 INFO L129 PetriNetUnfolder]: 1028/2082 cut-off events. [2021-03-11 20:14:21,353 INFO L130 PetriNetUnfolder]: For 2801/4191 co-relation queries the response was YES. [2021-03-11 20:14:21,361 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6620 conditions, 2082 events. 1028/2082 cut-off events. For 2801/4191 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 16984 event pairs, 454 based on Foata normal form. 97/1943 useless extension candidates. Maximal degree in co-relation 6596. Up to 1369 conditions per place. [2021-03-11 20:14:21,368 INFO L132 encePairwiseOnDemand]: 200/208 looper letters, 17 selfloop transitions, 19 changer transitions 4/68 dead transitions. [2021-03-11 20:14:21,368 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 68 transitions, 575 flow [2021-03-11 20:14:21,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 20:14:21,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 20:14:21,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 692 transitions. [2021-03-11 20:14:21,370 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8317307692307693 [2021-03-11 20:14:21,370 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 692 transitions. [2021-03-11 20:14:21,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 692 transitions. [2021-03-11 20:14:21,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:21,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 692 transitions. [2021-03-11 20:14:21,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:21,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:21,373 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:21,373 INFO L185 Difference]: Start difference. First operand has 57 places, 58 transitions, 405 flow. Second operand 4 states and 692 transitions. [2021-03-11 20:14:21,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 68 transitions, 575 flow [2021-03-11 20:14:21,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 68 transitions, 570 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 20:14:21,386 INFO L241 Difference]: Finished difference. Result has 62 places, 60 transitions, 514 flow [2021-03-11 20:14:21,387 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=514, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2021-03-11 20:14:21,387 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2021-03-11 20:14:21,387 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 514 flow [2021-03-11 20:14:21,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:21,387 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:21,387 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:21,387 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 20:14:21,387 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:21,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:21,393 INFO L82 PathProgramCache]: Analyzing trace with hash 334414108, now seen corresponding path program 1 times [2021-03-11 20:14:21,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:21,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656621441] [2021-03-11 20:14:21,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:21,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:21,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:21,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:21,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:21,447 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 20:14:21,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:14:21,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:21,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:14:21,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:21,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656621441] [2021-03-11 20:14:21,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:21,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:14:21,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830271872] [2021-03-11 20:14:21,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:14:21,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:21,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:14:21,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:14:21,454 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 208 [2021-03-11 20:14:21,455 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 514 flow. Second operand has 5 states, 5 states have (on average 170.8) internal successors, (854), 5 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:21,455 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:21,455 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 208 [2021-03-11 20:14:21,455 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:21,684 INFO L129 PetriNetUnfolder]: 776/1730 cut-off events. [2021-03-11 20:14:21,685 INFO L130 PetriNetUnfolder]: For 3042/4632 co-relation queries the response was YES. [2021-03-11 20:14:21,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6745 conditions, 1730 events. 776/1730 cut-off events. For 3042/4632 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 14243 event pairs, 126 based on Foata normal form. 549/2153 useless extension candidates. Maximal degree in co-relation 6717. Up to 1253 conditions per place. [2021-03-11 20:14:21,696 INFO L132 encePairwiseOnDemand]: 201/208 looper letters, 10 selfloop transitions, 19 changer transitions 0/73 dead transitions. [2021-03-11 20:14:21,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 73 transitions, 648 flow [2021-03-11 20:14:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:14:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:14:21,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1221 transitions. [2021-03-11 20:14:21,698 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8385989010989011 [2021-03-11 20:14:21,698 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1221 transitions. [2021-03-11 20:14:21,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1221 transitions. [2021-03-11 20:14:21,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:21,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1221 transitions. [2021-03-11 20:14:21,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 174.42857142857142) internal successors, (1221), 7 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:21,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:21,703 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:21,703 INFO L185 Difference]: Start difference. First operand has 62 places, 60 transitions, 514 flow. Second operand 7 states and 1221 transitions. [2021-03-11 20:14:21,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 73 transitions, 648 flow [2021-03-11 20:14:21,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 73 transitions, 627 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-11 20:14:21,712 INFO L241 Difference]: Finished difference. Result has 70 places, 69 transitions, 627 flow [2021-03-11 20:14:21,712 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=627, PETRI_PLACES=70, PETRI_TRANSITIONS=69} [2021-03-11 20:14:21,713 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2021-03-11 20:14:21,713 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 69 transitions, 627 flow [2021-03-11 20:14:21,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 170.8) internal successors, (854), 5 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:21,713 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:21,713 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:21,713 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 20:14:21,713 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:21,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:21,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1939375879, now seen corresponding path program 1 times [2021-03-11 20:14:21,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:21,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122714011] [2021-03-11 20:14:21,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:21,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:21,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:21,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:21,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:21,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:21,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:21,801 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 20:14:21,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:14:21,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:21,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:14:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:21,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122714011] [2021-03-11 20:14:21,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:21,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:14:21,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923845428] [2021-03-11 20:14:21,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:14:21,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:21,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:14:21,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:14:21,810 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 208 [2021-03-11 20:14:21,810 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 69 transitions, 627 flow. Second operand has 6 states, 6 states have (on average 170.83333333333334) internal successors, (1025), 6 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:21,810 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:21,810 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 208 [2021-03-11 20:14:21,810 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:21,992 INFO L129 PetriNetUnfolder]: 623/1460 cut-off events. [2021-03-11 20:14:21,992 INFO L130 PetriNetUnfolder]: For 6568/10164 co-relation queries the response was YES. [2021-03-11 20:14:21,999 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7877 conditions, 1460 events. 623/1460 cut-off events. For 6568/10164 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 12079 event pairs, 23 based on Foata normal form. 785/2136 useless extension candidates. Maximal degree in co-relation 7845. Up to 1142 conditions per place. [2021-03-11 20:14:22,005 INFO L132 encePairwiseOnDemand]: 201/208 looper letters, 6 selfloop transitions, 28 changer transitions 4/82 dead transitions. [2021-03-11 20:14:22,005 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 82 transitions, 829 flow [2021-03-11 20:14:22,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 20:14:22,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 20:14:22,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1570 transitions. [2021-03-11 20:14:22,008 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8386752136752137 [2021-03-11 20:14:22,008 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1570 transitions. [2021-03-11 20:14:22,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1570 transitions. [2021-03-11 20:14:22,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:22,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1570 transitions. [2021-03-11 20:14:22,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 174.44444444444446) internal successors, (1570), 9 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:22,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 208.0) internal successors, (2080), 10 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:22,015 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 208.0) internal successors, (2080), 10 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:22,015 INFO L185 Difference]: Start difference. First operand has 70 places, 69 transitions, 627 flow. Second operand 9 states and 1570 transitions. [2021-03-11 20:14:22,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 82 transitions, 829 flow [2021-03-11 20:14:22,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 82 transitions, 779 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-03-11 20:14:22,034 INFO L241 Difference]: Finished difference. Result has 78 places, 78 transitions, 755 flow [2021-03-11 20:14:22,034 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=755, PETRI_PLACES=78, PETRI_TRANSITIONS=78} [2021-03-11 20:14:22,035 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2021-03-11 20:14:22,035 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 78 transitions, 755 flow [2021-03-11 20:14:22,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 170.83333333333334) internal successors, (1025), 6 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:22,035 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:22,035 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:22,035 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 20:14:22,035 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:22,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:22,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1393891960, now seen corresponding path program 1 times [2021-03-11 20:14:22,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:22,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482132813] [2021-03-11 20:14:22,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:22,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:22,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:22,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:22,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:22,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:22,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:22,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:22,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:22,132 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 20:14:22,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:14:22,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:22,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:14:22,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:22,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482132813] [2021-03-11 20:14:22,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:22,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 20:14:22,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386849102] [2021-03-11 20:14:22,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 20:14:22,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:22,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 20:14:22,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-11 20:14:22,142 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 208 [2021-03-11 20:14:22,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 78 transitions, 755 flow. Second operand has 7 states, 7 states have (on average 170.85714285714286) internal successors, (1196), 7 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:22,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:22,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 208 [2021-03-11 20:14:22,143 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:22,337 INFO L129 PetriNetUnfolder]: 563/1345 cut-off events. [2021-03-11 20:14:22,338 INFO L130 PetriNetUnfolder]: For 8235/9907 co-relation queries the response was YES. [2021-03-11 20:14:22,345 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7714 conditions, 1345 events. 563/1345 cut-off events. For 8235/9907 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 11292 event pairs, 12 based on Foata normal form. 564/1801 useless extension candidates. Maximal degree in co-relation 7679. Up to 720 conditions per place. [2021-03-11 20:14:22,349 INFO L132 encePairwiseOnDemand]: 201/208 looper letters, 2 selfloop transitions, 33 changer transitions 8/83 dead transitions. [2021-03-11 20:14:22,349 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 83 transitions, 889 flow [2021-03-11 20:14:22,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-11 20:14:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-11 20:14:22,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1911 transitions. [2021-03-11 20:14:22,352 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8352272727272727 [2021-03-11 20:14:22,352 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1911 transitions. [2021-03-11 20:14:22,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1911 transitions. [2021-03-11 20:14:22,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:22,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1911 transitions. [2021-03-11 20:14:22,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 173.72727272727272) internal successors, (1911), 11 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:22,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 208.0) internal successors, (2496), 12 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:22,359 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 208.0) internal successors, (2496), 12 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:22,359 INFO L185 Difference]: Start difference. First operand has 78 places, 78 transitions, 755 flow. Second operand 11 states and 1911 transitions. [2021-03-11 20:14:22,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 83 transitions, 889 flow [2021-03-11 20:14:22,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 83 transitions, 788 flow, removed 36 selfloop flow, removed 4 redundant places. [2021-03-11 20:14:22,409 INFO L241 Difference]: Finished difference. Result has 87 places, 75 transitions, 696 flow [2021-03-11 20:14:22,409 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=696, PETRI_PLACES=87, PETRI_TRANSITIONS=75} [2021-03-11 20:14:22,409 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2021-03-11 20:14:22,409 INFO L480 AbstractCegarLoop]: Abstraction has has 87 places, 75 transitions, 696 flow [2021-03-11 20:14:22,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 170.85714285714286) internal successors, (1196), 7 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:22,410 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:22,410 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:22,410 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 20:14:22,410 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:22,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:22,410 INFO L82 PathProgramCache]: Analyzing trace with hash 878569404, now seen corresponding path program 1 times [2021-03-11 20:14:22,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:22,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903494138] [2021-03-11 20:14:22,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:22,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:22,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:14:22,541 INFO L142 QuantifierPusher]: treesize reduction 20, result has 71.4 percent of original size [2021-03-11 20:14:22,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-11 20:14:22,560 INFO L142 QuantifierPusher]: treesize reduction 20, result has 72.6 percent of original size [2021-03-11 20:14:22,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-11 20:14:22,582 INFO L142 QuantifierPusher]: treesize reduction 20, result has 72.6 percent of original size [2021-03-11 20:14:22,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-11 20:14:22,606 INFO L142 QuantifierPusher]: treesize reduction 18, result has 75.0 percent of original size [2021-03-11 20:14:22,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-03-11 20:14:22,644 INFO L142 QuantifierPusher]: treesize reduction 2, result has 96.8 percent of original size [2021-03-11 20:14:22,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-03-11 20:14:22,668 INFO L142 QuantifierPusher]: treesize reduction 18, result has 66.0 percent of original size [2021-03-11 20:14:22,669 INFO L147 QuantifierPusher]: treesize reduction 5, result has 85.7 percent of original size 30 [2021-03-11 20:14:22,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:22,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 20:14:22,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:22,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903494138] [2021-03-11 20:14:22,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:22,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 20:14:22,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756419071] [2021-03-11 20:14:22,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 20:14:22,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:22,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 20:14:22,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-03-11 20:14:22,692 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 208 [2021-03-11 20:14:22,693 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 75 transitions, 696 flow. Second operand has 9 states, 9 states have (on average 140.66666666666666) internal successors, (1266), 9 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:22,693 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:22,693 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 208 [2021-03-11 20:14:22,693 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:23,505 INFO L129 PetriNetUnfolder]: 2390/5457 cut-off events. [2021-03-11 20:14:23,505 INFO L130 PetriNetUnfolder]: For 41940/43993 co-relation queries the response was YES. [2021-03-11 20:14:23,532 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23213 conditions, 5457 events. 2390/5457 cut-off events. For 41940/43993 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 55625 event pairs, 83 based on Foata normal form. 656/5840 useless extension candidates. Maximal degree in co-relation 23174. Up to 1310 conditions per place. [2021-03-11 20:14:23,551 INFO L132 encePairwiseOnDemand]: 196/208 looper letters, 70 selfloop transitions, 78 changer transitions 4/192 dead transitions. [2021-03-11 20:14:23,551 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 192 transitions, 2005 flow [2021-03-11 20:14:23,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-11 20:14:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-11 20:14:23,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1626 transitions. [2021-03-11 20:14:23,554 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7106643356643356 [2021-03-11 20:14:23,554 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1626 transitions. [2021-03-11 20:14:23,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1626 transitions. [2021-03-11 20:14:23,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:23,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1626 transitions. [2021-03-11 20:14:23,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 147.8181818181818) internal successors, (1626), 11 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:23,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 208.0) internal successors, (2496), 12 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:23,560 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 208.0) internal successors, (2496), 12 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:23,560 INFO L185 Difference]: Start difference. First operand has 87 places, 75 transitions, 696 flow. Second operand 11 states and 1626 transitions. [2021-03-11 20:14:23,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 192 transitions, 2005 flow [2021-03-11 20:14:24,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 192 transitions, 1850 flow, removed 35 selfloop flow, removed 12 redundant places. [2021-03-11 20:14:24,067 INFO L241 Difference]: Finished difference. Result has 89 places, 145 transitions, 1606 flow [2021-03-11 20:14:24,067 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1606, PETRI_PLACES=89, PETRI_TRANSITIONS=145} [2021-03-11 20:14:24,068 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places. [2021-03-11 20:14:24,068 INFO L480 AbstractCegarLoop]: Abstraction has has 89 places, 145 transitions, 1606 flow [2021-03-11 20:14:24,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 140.66666666666666) internal successors, (1266), 9 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:24,068 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:24,068 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:24,068 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 20:14:24,068 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:24,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:24,069 INFO L82 PathProgramCache]: Analyzing trace with hash 525559890, now seen corresponding path program 2 times [2021-03-11 20:14:24,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:24,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90445936] [2021-03-11 20:14:24,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:24,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:24,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:14:24,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:24,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:24,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:24,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:24,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:24,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90445936] [2021-03-11 20:14:24,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:24,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:14:24,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942694883] [2021-03-11 20:14:24,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:14:24,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:24,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:14:24,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:14:24,109 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 208 [2021-03-11 20:14:24,110 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 145 transitions, 1606 flow. Second operand has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:24,110 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:24,110 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 208 [2021-03-11 20:14:24,110 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:24,410 INFO L129 PetriNetUnfolder]: 1805/4319 cut-off events. [2021-03-11 20:14:24,410 INFO L130 PetriNetUnfolder]: For 11045/11231 co-relation queries the response was YES. [2021-03-11 20:14:24,432 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16352 conditions, 4319 events. 1805/4319 cut-off events. For 11045/11231 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 44888 event pairs, 39 based on Foata normal form. 12/4032 useless extension candidates. Maximal degree in co-relation 16313. Up to 1189 conditions per place. [2021-03-11 20:14:24,437 INFO L132 encePairwiseOnDemand]: 205/208 looper letters, 3 selfloop transitions, 3 changer transitions 52/146 dead transitions. [2021-03-11 20:14:24,437 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 146 transitions, 1634 flow [2021-03-11 20:14:24,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 20:14:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 20:14:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 714 transitions. [2021-03-11 20:14:24,439 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8581730769230769 [2021-03-11 20:14:24,439 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 714 transitions. [2021-03-11 20:14:24,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 714 transitions. [2021-03-11 20:14:24,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:24,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 714 transitions. [2021-03-11 20:14:24,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 178.5) internal successors, (714), 4 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:24,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:24,441 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:24,442 INFO L185 Difference]: Start difference. First operand has 89 places, 145 transitions, 1606 flow. Second operand 4 states and 714 transitions. [2021-03-11 20:14:24,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 146 transitions, 1634 flow [2021-03-11 20:14:24,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 146 transitions, 1634 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-11 20:14:24,734 INFO L241 Difference]: Finished difference. Result has 94 places, 94 transitions, 866 flow [2021-03-11 20:14:24,735 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=1606, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=866, PETRI_PLACES=94, PETRI_TRANSITIONS=94} [2021-03-11 20:14:24,735 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 52 predicate places. [2021-03-11 20:14:24,735 INFO L480 AbstractCegarLoop]: Abstraction has has 94 places, 94 transitions, 866 flow [2021-03-11 20:14:24,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:24,735 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:24,735 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:24,735 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 20:14:24,735 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:24,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:24,736 INFO L82 PathProgramCache]: Analyzing trace with hash 846386306, now seen corresponding path program 3 times [2021-03-11 20:14:24,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:24,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671946612] [2021-03-11 20:14:24,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:24,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:24,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:14:24,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:24,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:24,772 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-11 20:14:24,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 20:14:24,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:24,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671946612] [2021-03-11 20:14:24,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:24,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:14:24,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91530214] [2021-03-11 20:14:24,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:14:24,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:24,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:14:24,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:14:24,779 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 208 [2021-03-11 20:14:24,780 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 94 transitions, 866 flow. Second operand has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 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-03-11 20:14:24,780 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:24,780 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 208 [2021-03-11 20:14:24,780 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:24,954 INFO L129 PetriNetUnfolder]: 805/2043 cut-off events. [2021-03-11 20:14:24,954 INFO L130 PetriNetUnfolder]: For 4961/5137 co-relation queries the response was YES. [2021-03-11 20:14:24,962 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7711 conditions, 2043 events. 805/2043 cut-off events. For 4961/5137 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 18727 event pairs, 17 based on Foata normal form. 9/1914 useless extension candidates. Maximal degree in co-relation 7670. Up to 550 conditions per place. [2021-03-11 20:14:24,964 INFO L132 encePairwiseOnDemand]: 201/208 looper letters, 7 selfloop transitions, 16 changer transitions 16/97 dead transitions. [2021-03-11 20:14:24,964 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 97 transitions, 985 flow [2021-03-11 20:14:24,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 20:14:24,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 20:14:24,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 690 transitions. [2021-03-11 20:14:24,965 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8293269230769231 [2021-03-11 20:14:24,965 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 690 transitions. [2021-03-11 20:14:24,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 690 transitions. [2021-03-11 20:14:24,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:24,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 690 transitions. [2021-03-11 20:14:24,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 172.5) internal successors, (690), 4 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:24,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:24,968 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:24,968 INFO L185 Difference]: Start difference. First operand has 94 places, 94 transitions, 866 flow. Second operand 4 states and 690 transitions. [2021-03-11 20:14:24,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 97 transitions, 985 flow [2021-03-11 20:14:25,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 97 transitions, 881 flow, removed 8 selfloop flow, removed 8 redundant places. [2021-03-11 20:14:25,020 INFO L241 Difference]: Finished difference. Result has 88 places, 81 transitions, 643 flow [2021-03-11 20:14:25,020 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=643, PETRI_PLACES=88, PETRI_TRANSITIONS=81} [2021-03-11 20:14:25,021 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 46 predicate places. [2021-03-11 20:14:25,021 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 81 transitions, 643 flow [2021-03-11 20:14:25,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 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-03-11 20:14:25,021 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:25,021 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:25,021 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 20:14:25,021 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:25,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:25,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1029067656, now seen corresponding path program 4 times [2021-03-11 20:14:25,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:25,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496319435] [2021-03-11 20:14:25,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:25,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:25,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:25,087 INFO L142 QuantifierPusher]: treesize reduction 5, result has 87.8 percent of original size [2021-03-11 20:14:25,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-11 20:14:25,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:25,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:14:25,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:25,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:25,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:25,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496319435] [2021-03-11 20:14:25,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:25,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:14:25,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239491682] [2021-03-11 20:14:25,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:14:25,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:25,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:14:25,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:14:25,113 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 208 [2021-03-11 20:14:25,114 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 81 transitions, 643 flow. Second operand has 6 states, 6 states have (on average 156.5) internal successors, (939), 6 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:25,114 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:25,114 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 208 [2021-03-11 20:14:25,114 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:25,309 INFO L129 PetriNetUnfolder]: 617/1686 cut-off events. [2021-03-11 20:14:25,309 INFO L130 PetriNetUnfolder]: For 6249/6663 co-relation queries the response was YES. [2021-03-11 20:14:25,317 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5987 conditions, 1686 events. 617/1686 cut-off events. For 6249/6663 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 15204 event pairs, 36 based on Foata normal form. 155/1715 useless extension candidates. Maximal degree in co-relation 5950. Up to 465 conditions per place. [2021-03-11 20:14:25,319 INFO L132 encePairwiseOnDemand]: 201/208 looper letters, 17 selfloop transitions, 13 changer transitions 17/100 dead transitions. [2021-03-11 20:14:25,319 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 100 transitions, 793 flow [2021-03-11 20:14:25,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:14:25,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:14:25,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1111 transitions. [2021-03-11 20:14:25,321 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7630494505494505 [2021-03-11 20:14:25,321 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1111 transitions. [2021-03-11 20:14:25,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1111 transitions. [2021-03-11 20:14:25,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:25,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1111 transitions. [2021-03-11 20:14:25,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 158.71428571428572) internal successors, (1111), 7 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:25,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:25,325 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:25,325 INFO L185 Difference]: Start difference. First operand has 88 places, 81 transitions, 643 flow. Second operand 7 states and 1111 transitions. [2021-03-11 20:14:25,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 100 transitions, 793 flow [2021-03-11 20:14:25,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 100 transitions, 735 flow, removed 4 selfloop flow, removed 4 redundant places. [2021-03-11 20:14:25,372 INFO L241 Difference]: Finished difference. Result has 94 places, 80 transitions, 573 flow [2021-03-11 20:14:25,372 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=573, PETRI_PLACES=94, PETRI_TRANSITIONS=80} [2021-03-11 20:14:25,372 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 52 predicate places. [2021-03-11 20:14:25,372 INFO L480 AbstractCegarLoop]: Abstraction has has 94 places, 80 transitions, 573 flow [2021-03-11 20:14:25,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 156.5) internal successors, (939), 6 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:25,373 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:25,373 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:25,373 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-11 20:14:25,373 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:25,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:25,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1403689506, now seen corresponding path program 5 times [2021-03-11 20:14:25,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:25,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463895836] [2021-03-11 20:14:25,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:25,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:25,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:14:25,459 INFO L142 QuantifierPusher]: treesize reduction 5, result has 88.6 percent of original size [2021-03-11 20:14:25,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-11 20:14:25,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:25,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:14:25,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:25,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:14:25,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:25,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:25,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463895836] [2021-03-11 20:14:25,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:25,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:14:25,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929705736] [2021-03-11 20:14:25,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 20:14:25,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:25,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 20:14:25,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-11 20:14:25,501 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 208 [2021-03-11 20:14:25,502 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 80 transitions, 573 flow. Second operand has 7 states, 7 states have (on average 153.28571428571428) internal successors, (1073), 7 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:25,502 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:25,502 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 208 [2021-03-11 20:14:25,502 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:25,722 INFO L129 PetriNetUnfolder]: 535/1396 cut-off events. [2021-03-11 20:14:25,723 INFO L130 PetriNetUnfolder]: For 4460/4774 co-relation queries the response was YES. [2021-03-11 20:14:25,730 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5093 conditions, 1396 events. 535/1396 cut-off events. For 4460/4774 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 12146 event pairs, 11 based on Foata normal form. 107/1398 useless extension candidates. Maximal degree in co-relation 5060. Up to 410 conditions per place. [2021-03-11 20:14:25,733 INFO L132 encePairwiseOnDemand]: 202/208 looper letters, 23 selfloop transitions, 15 changer transitions 1/92 dead transitions. [2021-03-11 20:14:25,733 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 92 transitions, 705 flow [2021-03-11 20:14:25,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:14:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:14:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1086 transitions. [2021-03-11 20:14:25,735 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7458791208791209 [2021-03-11 20:14:25,735 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1086 transitions. [2021-03-11 20:14:25,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1086 transitions. [2021-03-11 20:14:25,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:25,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1086 transitions. [2021-03-11 20:14:25,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 155.14285714285714) internal successors, (1086), 7 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:25,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:25,739 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:25,739 INFO L185 Difference]: Start difference. First operand has 94 places, 80 transitions, 573 flow. Second operand 7 states and 1086 transitions. [2021-03-11 20:14:25,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 92 transitions, 705 flow [2021-03-11 20:14:25,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 92 transitions, 622 flow, removed 4 selfloop flow, removed 13 redundant places. [2021-03-11 20:14:25,771 INFO L241 Difference]: Finished difference. Result has 88 places, 86 transitions, 577 flow [2021-03-11 20:14:25,772 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=577, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2021-03-11 20:14:25,772 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 46 predicate places. [2021-03-11 20:14:25,772 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 577 flow [2021-03-11 20:14:25,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 153.28571428571428) internal successors, (1073), 7 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:25,773 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:25,773 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:25,773 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-11 20:14:25,773 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:25,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:25,773 INFO L82 PathProgramCache]: Analyzing trace with hash 342011374, now seen corresponding path program 6 times [2021-03-11 20:14:25,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:25,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409477420] [2021-03-11 20:14:25,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:25,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:25,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:14:25,869 INFO L142 QuantifierPusher]: treesize reduction 46, result has 68.3 percent of original size [2021-03-11 20:14:25,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 99 [2021-03-11 20:14:25,912 INFO L142 QuantifierPusher]: treesize reduction 54, result has 69.8 percent of original size [2021-03-11 20:14:25,915 INFO L147 QuantifierPusher]: treesize reduction 9, result has 92.8 percent of original size 116 [2021-03-11 20:14:25,958 INFO L142 QuantifierPusher]: treesize reduction 32, result has 57.3 percent of original size [2021-03-11 20:14:25,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-03-11 20:14:25,989 INFO L142 QuantifierPusher]: treesize reduction 32, result has 46.7 percent of original size [2021-03-11 20:14:25,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-11 20:14:26,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:26,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:14:26,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:26,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409477420] [2021-03-11 20:14:26,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:26,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 20:14:26,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815170038] [2021-03-11 20:14:26,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 20:14:26,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:26,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 20:14:26,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-11 20:14:26,018 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 208 [2021-03-11 20:14:26,019 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 577 flow. Second operand has 8 states, 8 states have (on average 151.125) internal successors, (1209), 8 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:26,019 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:26,019 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 208 [2021-03-11 20:14:26,019 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:26,214 INFO L129 PetriNetUnfolder]: 572/1484 cut-off events. [2021-03-11 20:14:26,214 INFO L130 PetriNetUnfolder]: For 4781/5118 co-relation queries the response was YES. [2021-03-11 20:14:26,220 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5451 conditions, 1484 events. 572/1484 cut-off events. For 4781/5118 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 12877 event pairs, 19 based on Foata normal form. 92/1453 useless extension candidates. Maximal degree in co-relation 5418. Up to 435 conditions per place. [2021-03-11 20:14:26,222 INFO L132 encePairwiseOnDemand]: 202/208 looper letters, 24 selfloop transitions, 9 changer transitions 15/98 dead transitions. [2021-03-11 20:14:26,222 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 98 transitions, 750 flow [2021-03-11 20:14:26,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:14:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:14:26,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 924 transitions. [2021-03-11 20:14:26,240 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7403846153846154 [2021-03-11 20:14:26,240 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 924 transitions. [2021-03-11 20:14:26,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 924 transitions. [2021-03-11 20:14:26,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:26,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 924 transitions. [2021-03-11 20:14:26,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:26,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 208.0) internal successors, (1456), 7 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:26,243 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 208.0) internal successors, (1456), 7 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:26,243 INFO L185 Difference]: Start difference. First operand has 88 places, 86 transitions, 577 flow. Second operand 6 states and 924 transitions. [2021-03-11 20:14:26,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 98 transitions, 750 flow [2021-03-11 20:14:26,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 98 transitions, 738 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-11 20:14:26,279 INFO L241 Difference]: Finished difference. Result has 93 places, 77 transitions, 518 flow [2021-03-11 20:14:26,279 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=518, PETRI_PLACES=93, PETRI_TRANSITIONS=77} [2021-03-11 20:14:26,279 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 51 predicate places. [2021-03-11 20:14:26,279 INFO L480 AbstractCegarLoop]: Abstraction has has 93 places, 77 transitions, 518 flow [2021-03-11 20:14:26,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 151.125) internal successors, (1209), 8 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:26,279 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:26,279 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:26,279 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-11 20:14:26,280 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:26,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:26,280 INFO L82 PathProgramCache]: Analyzing trace with hash -827359958, now seen corresponding path program 7 times [2021-03-11 20:14:26,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:26,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987616916] [2021-03-11 20:14:26,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:26,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:26,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:14:26,343 INFO L142 QuantifierPusher]: treesize reduction 14, result has 81.8 percent of original size [2021-03-11 20:14:26,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 63 [2021-03-11 20:14:26,370 INFO L142 QuantifierPusher]: treesize reduction 9, result has 75.7 percent of original size [2021-03-11 20:14:26,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-11 20:14:26,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:26,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-11 20:14:26,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:26,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 20:14:26,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:26,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 20:14:26,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:26,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987616916] [2021-03-11 20:14:26,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:26,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 20:14:26,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451845411] [2021-03-11 20:14:26,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 20:14:26,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:26,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 20:14:26,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-11 20:14:26,416 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 208 [2021-03-11 20:14:26,417 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 77 transitions, 518 flow. Second operand has 8 states, 8 states have (on average 134.75) internal successors, (1078), 8 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:26,417 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:26,417 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 208 [2021-03-11 20:14:26,417 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:26,664 INFO L129 PetriNetUnfolder]: 595/1551 cut-off events. [2021-03-11 20:14:26,664 INFO L130 PetriNetUnfolder]: For 5293/5578 co-relation queries the response was YES. [2021-03-11 20:14:26,670 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5693 conditions, 1551 events. 595/1551 cut-off events. For 5293/5578 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 13920 event pairs, 10 based on Foata normal form. 109/1556 useless extension candidates. Maximal degree in co-relation 5660. Up to 470 conditions per place. [2021-03-11 20:14:26,672 INFO L132 encePairwiseOnDemand]: 197/208 looper letters, 22 selfloop transitions, 20 changer transitions 14/97 dead transitions. [2021-03-11 20:14:26,672 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 97 transitions, 762 flow [2021-03-11 20:14:26,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 20:14:26,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-11 20:14:26,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1103 transitions. [2021-03-11 20:14:26,674 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6628605769230769 [2021-03-11 20:14:26,674 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1103 transitions. [2021-03-11 20:14:26,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1103 transitions. [2021-03-11 20:14:26,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:26,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1103 transitions. [2021-03-11 20:14:26,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 137.875) internal successors, (1103), 8 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:26,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 208.0) internal successors, (1872), 9 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:26,678 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 208.0) internal successors, (1872), 9 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:26,678 INFO L185 Difference]: Start difference. First operand has 93 places, 77 transitions, 518 flow. Second operand 8 states and 1103 transitions. [2021-03-11 20:14:26,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 97 transitions, 762 flow [2021-03-11 20:14:26,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 97 transitions, 719 flow, removed 6 selfloop flow, removed 7 redundant places. [2021-03-11 20:14:26,716 INFO L241 Difference]: Finished difference. Result has 95 places, 79 transitions, 558 flow [2021-03-11 20:14:26,717 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=558, PETRI_PLACES=95, PETRI_TRANSITIONS=79} [2021-03-11 20:14:26,717 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 53 predicate places. [2021-03-11 20:14:26,717 INFO L480 AbstractCegarLoop]: Abstraction has has 95 places, 79 transitions, 558 flow [2021-03-11 20:14:26,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 134.75) internal successors, (1078), 8 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:26,717 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:26,717 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:26,717 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-11 20:14:26,717 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:26,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:26,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1617588540, now seen corresponding path program 8 times [2021-03-11 20:14:26,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:26,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135145529] [2021-03-11 20:14:26,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:14:26,777 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:14:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:14:26,815 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:14:26,846 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 20:14:26,847 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 20:14:26,847 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-11 20:14:26,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:14:26 BasicIcfg [2021-03-11 20:14:26,918 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 20:14:26,919 INFO L168 Benchmark]: Toolchain (without parser) took 13575.76 ms. Allocated memory was 350.2 MB in the beginning and 671.1 MB in the end (delta: 320.9 MB). Free memory was 313.0 MB in the beginning and 637.3 MB in the end (delta: -324.2 MB). Peak memory consumption was 395.0 MB. Max. memory is 16.0 GB. [2021-03-11 20:14:26,919 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 350.2 MB. Free memory was 331.5 MB in the beginning and 331.5 MB in the end (delta: 69.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 20:14:26,919 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.08 ms. Allocated memory is still 350.2 MB. Free memory was 312.4 MB in the beginning and 309.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB. [2021-03-11 20:14:26,919 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.31 ms. Allocated memory is still 350.2 MB. Free memory was 309.3 MB in the beginning and 307.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:14:26,920 INFO L168 Benchmark]: Boogie Preprocessor took 21.17 ms. Allocated memory is still 350.2 MB. Free memory was 307.2 MB in the beginning and 305.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:14:26,920 INFO L168 Benchmark]: RCFGBuilder took 1450.93 ms. Allocated memory is still 350.2 MB. Free memory was 305.1 MB in the beginning and 203.2 MB in the end (delta: 101.9 MB). Peak memory consumption was 123.8 MB. Max. memory is 16.0 GB. [2021-03-11 20:14:26,920 INFO L168 Benchmark]: TraceAbstraction took 11701.30 ms. Allocated memory was 350.2 MB in the beginning and 671.1 MB in the end (delta: 320.9 MB). Free memory was 202.1 MB in the beginning and 637.3 MB in the end (delta: -435.1 MB). Peak memory consumption was 282.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:14:26,921 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 350.2 MB. Free memory was 331.5 MB in the beginning and 331.5 MB in the end (delta: 69.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 365.08 ms. Allocated memory is still 350.2 MB. Free memory was 312.4 MB in the beginning and 309.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 29.31 ms. Allocated memory is still 350.2 MB. Free memory was 309.3 MB in the beginning and 307.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 21.17 ms. Allocated memory is still 350.2 MB. Free memory was 307.2 MB in the beginning and 305.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1450.93 ms. Allocated memory is still 350.2 MB. Free memory was 305.1 MB in the beginning and 203.2 MB in the end (delta: 101.9 MB). Peak memory consumption was 123.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 11701.30 ms. Allocated memory was 350.2 MB in the beginning and 671.1 MB in the end (delta: 320.9 MB). Free memory was 202.1 MB in the beginning and 637.3 MB in the end (delta: -435.1 MB). Peak memory consumption was 282.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4694.9ms, 122 PlacesBefore, 42 PlacesAfterwards, 111 TransitionsBefore, 29 TransitionsAfterwards, 2672 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 93 TotalNumberOfCompositions, 7058 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2981, positive: 2790, positive conditional: 0, positive unconditional: 2790, negative: 191, negative conditional: 0, negative unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1826, positive: 1758, positive conditional: 0, positive unconditional: 1758, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1826, positive: 1742, positive conditional: 0, positive unconditional: 1742, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 84, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 574, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 536, negative conditional: 0, negative unconditional: 536, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2981, positive: 1032, positive conditional: 0, positive unconditional: 1032, negative: 123, negative conditional: 0, negative unconditional: 123, unknown: 1826, unknown conditional: 0, unknown unconditional: 1826] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 162, Positive conditional cache size: 0, Positive unconditional cache size: 162, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L859] 0 pthread_t t1473; [L860] FCALL, FORK 0 pthread_create(&t1473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1474; [L862] FCALL, FORK 0 pthread_create(&t1474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L863] 0 pthread_t t1475; [L864] FCALL, FORK 0 pthread_create(&t1475, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L798] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L801] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L865] 0 pthread_t t1476; [L866] FCALL, FORK 0 pthread_create(&t1476, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L818] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L825] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L826] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L827] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L828] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L829] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L830] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L831] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = a [L833] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=50, weak$$choice2=255, x=2, y=1, z=2] [L837] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L837] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L837] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L837] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L839] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L841] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L764] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L804] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L804] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L804] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L872] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L872] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L872] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L872] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L874] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L876] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=50, weak$$choice2=255, x=2, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 11547.5ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 4913.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4745.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 121 SDtfs, 90 SDslu, 128 SDs, 0 SdLazy, 695 SolverSat, 198 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 674.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 729.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1606occurred in iteration=10, InterpolantAutomatonStates: 97, 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: 74.1ms SsaConstructionTime, 469.2ms SatisfiabilityAnalysisTime, 1093.9ms InterpolantComputationTime, 341 NumberOfCodeBlocks, 341 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 2808 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...