/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/thin002_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 15:06:12,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 15:06:12,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 15:06:12,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 15:06:12,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 15:06:12,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 15:06:12,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 15:06:12,406 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 15:06:12,407 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 15:06:12,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 15:06:12,411 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 15:06:12,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 15:06:12,412 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 15:06:12,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 15:06:12,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 15:06:12,418 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 15:06:12,420 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 15:06:12,421 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 15:06:12,422 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 15:06:12,423 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 15:06:12,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 15:06:12,425 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 15:06:12,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 15:06:12,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 15:06:12,433 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 15:06:12,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 15:06:12,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 15:06:12,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 15:06:12,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 15:06:12,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 15:06:12,434 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 15:06:12,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 15:06:12,435 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 15:06:12,436 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 15:06:12,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 15:06:12,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 15:06:12,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 15:06:12,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 15:06:12,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 15:06:12,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 15:06:12,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 15:06:12,444 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-RepeatedSemanticLbe.epf [2021-03-25 15:06:12,468 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 15:06:12,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 15:06:12,471 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 15:06:12,471 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 15:06:12,471 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 15:06:12,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 15:06:12,471 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 15:06:12,471 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 15:06:12,471 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 15:06:12,471 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 15:06:12,472 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 15:06:12,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 15:06:12,472 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 15:06:12,472 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 15:06:12,472 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 15:06:12,472 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 15:06:12,472 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 15:06:12,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 15:06:12,473 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 15:06:12,473 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 15:06:12,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 15:06:12,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 15:06:12,473 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 15:06:12,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 15:06:12,473 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 15:06:12,473 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 15:06:12,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 15:06:12,473 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 15:06:12,474 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 15:06:12,474 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true 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-25 15:06:12,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 15:06:12,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 15:06:12,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 15:06:12,735 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 15:06:12,737 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 15:06:12,737 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_rmo.oepc.i [2021-03-25 15:06:12,802 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51e70b076/14cfdb3d16ab4f6a88d51c255251191b/FLAG44a5864c8 [2021-03-25 15:06:13,226 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 15:06:13,233 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_rmo.oepc.i [2021-03-25 15:06:13,255 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51e70b076/14cfdb3d16ab4f6a88d51c255251191b/FLAG44a5864c8 [2021-03-25 15:06:13,266 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51e70b076/14cfdb3d16ab4f6a88d51c255251191b [2021-03-25 15:06:13,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 15:06:13,268 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 15:06:13,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 15:06:13,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 15:06:13,272 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 15:06:13,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 03:06:13" (1/1) ... [2021-03-25 15:06:13,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bf834f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:06:13, skipping insertion in model container [2021-03-25 15:06:13,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 03:06:13" (1/1) ... [2021-03-25 15:06:13,278 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 15:06:13,300 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 15:06:13,396 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/thin002_rmo.oepc.i[993,1006] [2021-03-25 15:06:13,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 15:06:13,523 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 15:06:13,530 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_rmo.oepc.i[993,1006] [2021-03-25 15:06:13,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 15:06:13,607 INFO L208 MainTranslator]: Completed translation [2021-03-25 15:06:13,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:06:13 WrapperNode [2021-03-25 15:06:13,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 15:06:13,608 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 15:06:13,608 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 15:06:13,609 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 15:06:13,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:06:13" (1/1) ... [2021-03-25 15:06:13,628 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:06:13" (1/1) ... [2021-03-25 15:06:13,647 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 15:06:13,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 15:06:13,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 15:06:13,648 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 15:06:13,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:06:13" (1/1) ... [2021-03-25 15:06:13,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:06:13" (1/1) ... [2021-03-25 15:06:13,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:06:13" (1/1) ... [2021-03-25 15:06:13,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:06:13" (1/1) ... [2021-03-25 15:06:13,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:06:13" (1/1) ... [2021-03-25 15:06:13,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:06:13" (1/1) ... [2021-03-25 15:06:13,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:06:13" (1/1) ... [2021-03-25 15:06:13,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 15:06:13,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 15:06:13,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 15:06:13,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 15:06:13,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:06: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-25 15:06:13,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-25 15:06:13,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 15:06:13,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 15:06:13,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 15:06:13,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 15:06:13,792 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 15:06:13,792 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 15:06:13,792 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 15:06:13,792 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 15:06:13,792 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 15:06:13,792 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 15:06:13,793 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 15:06:13,793 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 15:06:13,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 15:06:13,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 15:06:13,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 15:06:13,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 15:06:13,794 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 15:06:15,161 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 15:06:15,161 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-03-25 15:06:15,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 03:06:15 BoogieIcfgContainer [2021-03-25 15:06:15,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 15:06:15,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 15:06:15,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 15:06:15,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 15:06:15,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 03:06:13" (1/3) ... [2021-03-25 15:06:15,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e1fa205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 03:06:15, skipping insertion in model container [2021-03-25 15:06:15,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:06:13" (2/3) ... [2021-03-25 15:06:15,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e1fa205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 03:06:15, skipping insertion in model container [2021-03-25 15:06:15,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 03:06:15" (3/3) ... [2021-03-25 15:06:15,167 INFO L111 eAbstractionObserver]: Analyzing ICFG thin002_rmo.oepc.i [2021-03-25 15:06:15,171 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 15:06:15,174 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-25 15:06:15,175 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 15:06:15,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,205 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,205 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,205 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,205 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,216 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,216 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,216 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,216 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,217 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,217 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,217 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,217 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,217 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,217 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,218 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,218 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,218 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,218 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,218 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,218 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,218 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,218 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,218 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,218 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,218 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,218 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,218 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,218 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,222 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,222 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,223 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,223 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,223 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,223 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,224 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,224 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,224 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,224 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,224 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,224 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,224 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,225 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,226 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,229 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,229 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:06:15,230 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 15:06:15,243 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-25 15:06:15,257 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 15:06:15,257 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 15:06:15,257 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 15:06:15,257 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 15:06:15,257 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 15:06:15,258 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 15:06:15,258 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 15:06:15,258 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 15:06:15,266 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2021-03-25 15:06:15,296 INFO L129 PetriNetUnfolder]: 2/129 cut-off events. [2021-03-25 15:06:15,297 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:06:15,299 INFO L84 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2021-03-25 15:06:15,300 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2021-03-25 15:06:15,307 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 115 transitions, 242 flow [2021-03-25 15:06:15,308 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:06:15,316 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 115 transitions, 242 flow [2021-03-25 15:06:15,318 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 115 transitions, 242 flow [2021-03-25 15:06:15,319 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 115 transitions, 242 flow [2021-03-25 15:06:15,333 INFO L129 PetriNetUnfolder]: 1/115 cut-off events. [2021-03-25 15:06:15,334 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:06:15,334 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 1/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2021-03-25 15:06:15,336 INFO L142 LiptonReduction]: Number of co-enabled transitions 1506 [2021-03-25 15:06:16,806 WARN L205 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 198 [2021-03-25 15:06:17,133 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-03-25 15:06:18,494 WARN L205 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 322 DAG size of output: 278 [2021-03-25 15:06:19,013 WARN L205 SmtUtils]: Spent 516.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2021-03-25 15:06:19,243 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2021-03-25 15:06:19,613 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2021-03-25 15:06:19,728 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-25 15:06:22,483 INFO L154 LiptonReduction]: Checked pairs total: 2448 [2021-03-25 15:06:22,487 INFO L156 LiptonReduction]: Total number of compositions: 74 [2021-03-25 15:06:22,488 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7181 [2021-03-25 15:06:22,506 INFO L129 PetriNetUnfolder]: 1/43 cut-off events. [2021-03-25 15:06:22,506 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:06:22,506 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:06:22,506 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:06:22,507 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:06:22,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:06:22,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1242854848, now seen corresponding path program 1 times [2021-03-25 15:06:22,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:06:22,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573742738] [2021-03-25 15:06:22,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:06:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:06:22,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:22,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:06:22,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:22,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:06:22,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:22,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:06:22,789 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-25 15:06:22,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573742738] [2021-03-25 15:06:22,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:06:22,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 15:06:22,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047248159] [2021-03-25 15:06:22,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 15:06:22,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:06:22,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 15:06:22,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 15:06:22,805 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 207 [2021-03-25 15:06:22,809 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 190.75) internal successors, (763), 4 states have internal predecessors, (763), 0 states have call successors, (0), 0 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-25 15:06:22,810 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:06:22,810 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 207 [2021-03-25 15:06:22,810 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:06:22,834 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2021-03-25 15:06:22,834 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:06:22,835 INFO L84 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 46 events. 0/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 4/49 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-25 15:06:22,835 INFO L132 encePairwiseOnDemand]: 202/207 looper letters, 2 selfloop transitions, 2 changer transitions 3/44 dead transitions. [2021-03-25 15:06:22,836 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 44 transitions, 112 flow [2021-03-25 15:06:22,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 15:06:22,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 15:06:22,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 960 transitions. [2021-03-25 15:06:22,850 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.927536231884058 [2021-03-25 15:06:22,850 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 960 transitions. [2021-03-25 15:06:22,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 960 transitions. [2021-03-25 15:06:22,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:06:22,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 960 transitions. [2021-03-25 15:06:22,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 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-25 15:06:22,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 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-25 15:06:22,871 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 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-25 15:06:22,872 INFO L185 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 5 states and 960 transitions. [2021-03-25 15:06:22,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 44 transitions, 112 flow [2021-03-25 15:06:22,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 44 transitions, 108 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 15:06:22,877 INFO L241 Difference]: Finished difference. Result has 58 places, 41 transitions, 102 flow [2021-03-25 15:06:22,879 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2021-03-25 15:06:22,879 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2021-03-25 15:06:22,879 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:06:22,879 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 41 transitions, 102 flow [2021-03-25 15:06:22,880 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 41 transitions, 102 flow [2021-03-25 15:06:22,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 41 transitions, 102 flow [2021-03-25 15:06:22,923 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2021-03-25 15:06:22,923 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 15:06:22,923 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 41 events. 0/41 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 15:06:22,924 INFO L142 LiptonReduction]: Number of co-enabled transitions 298 [2021-03-25 15:06:25,484 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-25 15:06:25,617 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 15:06:25,894 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-25 15:06:26,027 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 15:06:26,030 INFO L154 LiptonReduction]: Checked pairs total: 1531 [2021-03-25 15:06:26,030 INFO L156 LiptonReduction]: Total number of compositions: 16 [2021-03-25 15:06:26,031 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3152 [2021-03-25 15:06:26,031 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 70 flow [2021-03-25 15:06:26,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 190.75) internal successors, (763), 4 states have internal predecessors, (763), 0 states have call successors, (0), 0 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-25 15:06:26,032 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:06:26,032 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:06:26,032 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 15:06:26,032 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:06:26,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:06:26,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1423867321, now seen corresponding path program 1 times [2021-03-25 15:06:26,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:06:26,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154609935] [2021-03-25 15:06:26,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:06:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:06:26,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:26,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:06:26,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:26,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:06:26,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:26,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 15:06:26,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:26,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:06:26,107 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-25 15:06:26,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154609935] [2021-03-25 15:06:26,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:06:26,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 15:06:26,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883802135] [2021-03-25 15:06:26,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 15:06:26,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:06:26,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 15:06:26,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 15:06:26,111 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 223 [2021-03-25 15:06:26,112 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 70 flow. Second operand has 5 states, 5 states have (on average 201.8) internal successors, (1009), 5 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:06:26,112 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:06:26,112 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 223 [2021-03-25 15:06:26,112 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:06:26,131 INFO L129 PetriNetUnfolder]: 0/25 cut-off events. [2021-03-25 15:06:26,131 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-03-25 15:06:26,132 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 25 events. 0/25 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 0 based on Foata normal form. 1/26 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 15:06:26,132 INFO L132 encePairwiseOnDemand]: 220/223 looper letters, 1 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2021-03-25 15:06:26,132 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 25 transitions, 76 flow [2021-03-25 15:06:26,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 15:06:26,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 15:06:26,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 607 transitions. [2021-03-25 15:06:26,134 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9073243647234679 [2021-03-25 15:06:26,134 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 607 transitions. [2021-03-25 15:06:26,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 607 transitions. [2021-03-25 15:06:26,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:06:26,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 607 transitions. [2021-03-25 15:06:26,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:06:26,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 0 states have call successors, (0), 0 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-25 15:06:26,139 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 0 states have call successors, (0), 0 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-25 15:06:26,139 INFO L185 Difference]: Start difference. First operand has 39 places, 25 transitions, 70 flow. Second operand 3 states and 607 transitions. [2021-03-25 15:06:26,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 25 transitions, 76 flow [2021-03-25 15:06:26,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 25 transitions, 68 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-25 15:06:26,143 INFO L241 Difference]: Finished difference. Result has 38 places, 25 transitions, 70 flow [2021-03-25 15:06:26,143 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2021-03-25 15:06:26,144 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -18 predicate places. [2021-03-25 15:06:26,144 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:06:26,144 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 25 transitions, 70 flow [2021-03-25 15:06:26,144 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 25 transitions, 70 flow [2021-03-25 15:06:26,145 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 25 transitions, 70 flow [2021-03-25 15:06:26,148 INFO L129 PetriNetUnfolder]: 0/25 cut-off events. [2021-03-25 15:06:26,148 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 15:06:26,148 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 25 events. 0/25 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 15:06:26,148 INFO L142 LiptonReduction]: Number of co-enabled transitions 272 [2021-03-25 15:06:26,691 WARN L205 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 173 [2021-03-25 15:06:26,924 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2021-03-25 15:06:27,428 WARN L205 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 173 [2021-03-25 15:06:27,695 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2021-03-25 15:06:27,698 INFO L154 LiptonReduction]: Checked pairs total: 572 [2021-03-25 15:06:27,698 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 15:06:27,698 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1554 [2021-03-25 15:06:27,698 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 68 flow [2021-03-25 15:06:27,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 201.8) internal successors, (1009), 5 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:06:27,699 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:06:27,699 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:06:27,699 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 15:06:27,699 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:06:27,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:06:27,700 INFO L82 PathProgramCache]: Analyzing trace with hash 408052015, now seen corresponding path program 1 times [2021-03-25 15:06:27,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:06:27,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174266879] [2021-03-25 15:06:27,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:06:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:06:27,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:27,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:06:27,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:27,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:06:27,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:27,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:06:27,732 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-25 15:06:27,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174266879] [2021-03-25 15:06:27,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:06:27,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 15:06:27,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330667243] [2021-03-25 15:06:27,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 15:06:27,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:06:27,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 15:06:27,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 15:06:27,736 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 224 [2021-03-25 15:06:27,737 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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-25 15:06:27,737 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:06:27,737 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 224 [2021-03-25 15:06:27,737 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:06:27,750 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-03-25 15:06:27,751 INFO L130 PetriNetUnfolder]: For 9/16 co-relation queries the response was YES. [2021-03-25 15:06:27,751 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 29 events. 0/29 cut-off events. For 9/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 2/31 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-25 15:06:27,751 INFO L132 encePairwiseOnDemand]: 220/224 looper letters, 1 selfloop transitions, 3 changer transitions 1/25 dead transitions. [2021-03-25 15:06:27,751 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 25 transitions, 81 flow [2021-03-25 15:06:27,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 15:06:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 15:06:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 791 transitions. [2021-03-25 15:06:27,753 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8828125 [2021-03-25 15:06:27,753 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 791 transitions. [2021-03-25 15:06:27,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 791 transitions. [2021-03-25 15:06:27,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:06:27,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 791 transitions. [2021-03-25 15:06:27,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 0 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-25 15:06:27,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:06:27,756 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:06:27,756 INFO L185 Difference]: Start difference. First operand has 37 places, 24 transitions, 68 flow. Second operand 4 states and 791 transitions. [2021-03-25 15:06:27,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 25 transitions, 81 flow [2021-03-25 15:06:27,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 25 transitions, 77 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 15:06:27,757 INFO L241 Difference]: Finished difference. Result has 40 places, 24 transitions, 78 flow [2021-03-25 15:06:27,757 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2021-03-25 15:06:27,757 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -16 predicate places. [2021-03-25 15:06:27,757 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:06:27,758 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 24 transitions, 78 flow [2021-03-25 15:06:27,758 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 24 transitions, 78 flow [2021-03-25 15:06:27,758 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 24 transitions, 78 flow [2021-03-25 15:06:27,780 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-25 15:06:27,780 INFO L130 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2021-03-25 15:06:27,780 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 24 events. 0/24 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 15:06:27,780 INFO L142 LiptonReduction]: Number of co-enabled transitions 256 [2021-03-25 15:06:28,051 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2021-03-25 15:06:28,320 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2021-03-25 15:06:28,850 WARN L205 SmtUtils]: Spent 528.00 ms on a formula simplification that was a NOOP. DAG size: 277 [2021-03-25 15:06:29,400 WARN L205 SmtUtils]: Spent 549.00 ms on a formula simplification that was a NOOP. DAG size: 277 [2021-03-25 15:06:29,421 INFO L154 LiptonReduction]: Checked pairs total: 445 [2021-03-25 15:06:29,421 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 15:06:29,421 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1664 [2021-03-25 15:06:29,422 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 23 transitions, 76 flow [2021-03-25 15:06:29,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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-25 15:06:29,423 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:06:29,423 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:06:29,423 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 15:06:29,423 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:06:29,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:06:29,423 INFO L82 PathProgramCache]: Analyzing trace with hash 439535193, now seen corresponding path program 1 times [2021-03-25 15:06:29,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:06:29,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389002449] [2021-03-25 15:06:29,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:06:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:06:29,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:29,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:06:29,456 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-25 15:06:29,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389002449] [2021-03-25 15:06:29,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:06:29,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 15:06:29,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430380210] [2021-03-25 15:06:29,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 15:06:29,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:06:29,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 15:06:29,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 15:06:29,458 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 225 [2021-03-25 15:06:29,458 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 23 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 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-25 15:06:29,459 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:06:29,459 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 225 [2021-03-25 15:06:29,459 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:06:29,464 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-25 15:06:29,464 INFO L130 PetriNetUnfolder]: For 23/25 co-relation queries the response was YES. [2021-03-25 15:06:29,464 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 23 events. 0/23 cut-off events. For 23/25 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 15:06:29,465 INFO L132 encePairwiseOnDemand]: 222/225 looper letters, 1 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2021-03-25 15:06:29,465 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 23 transitions, 82 flow [2021-03-25 15:06:29,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 15:06:29,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 15:06:29,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 622 transitions. [2021-03-25 15:06:29,466 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214814814814815 [2021-03-25 15:06:29,466 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 622 transitions. [2021-03-25 15:06:29,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 622 transitions. [2021-03-25 15:06:29,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:06:29,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 622 transitions. [2021-03-25 15:06:29,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 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-25 15:06:29,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 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-25 15:06:29,469 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 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-25 15:06:29,469 INFO L185 Difference]: Start difference. First operand has 39 places, 23 transitions, 76 flow. Second operand 3 states and 622 transitions. [2021-03-25 15:06:29,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 23 transitions, 82 flow [2021-03-25 15:06:29,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 23 transitions, 70 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-25 15:06:29,470 INFO L241 Difference]: Finished difference. Result has 38 places, 23 transitions, 72 flow [2021-03-25 15:06:29,470 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2021-03-25 15:06:29,470 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -18 predicate places. [2021-03-25 15:06:29,470 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:06:29,470 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 23 transitions, 72 flow [2021-03-25 15:06:29,470 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 23 transitions, 72 flow [2021-03-25 15:06:29,470 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 23 transitions, 72 flow [2021-03-25 15:06:29,473 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-25 15:06:29,473 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-25 15:06:29,473 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 23 events. 0/23 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 15:06:29,473 INFO L142 LiptonReduction]: Number of co-enabled transitions 224 [2021-03-25 15:06:32,465 INFO L154 LiptonReduction]: Checked pairs total: 197 [2021-03-25 15:06:32,465 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:06:32,465 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2995 [2021-03-25 15:06:32,466 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 72 flow [2021-03-25 15:06:32,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 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-25 15:06:32,466 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:06:32,466 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:06:32,466 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 15:06:32,466 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:06:32,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:06:32,467 INFO L82 PathProgramCache]: Analyzing trace with hash -939670875, now seen corresponding path program 1 times [2021-03-25 15:06:32,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:06:32,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895602518] [2021-03-25 15:06:32,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:06:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:06:32,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:32,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:06:32,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:32,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:06:32,533 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-25 15:06:32,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895602518] [2021-03-25 15:06:32,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:06:32,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 15:06:32,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789327811] [2021-03-25 15:06:32,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 15:06:32,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:06:32,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 15:06:32,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 15:06:32,534 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 225 [2021-03-25 15:06:32,535 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 0 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-25 15:06:32,535 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:06:32,535 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 225 [2021-03-25 15:06:32,536 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:06:32,578 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-03-25 15:06:32,578 INFO L130 PetriNetUnfolder]: For 17/19 co-relation queries the response was YES. [2021-03-25 15:06:32,578 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 29 events. 0/29 cut-off events. For 17/19 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 3/32 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-25 15:06:32,579 INFO L132 encePairwiseOnDemand]: 221/225 looper letters, 1 selfloop transitions, 3 changer transitions 1/24 dead transitions. [2021-03-25 15:06:32,579 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 24 transitions, 85 flow [2021-03-25 15:06:32,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 15:06:32,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 15:06:32,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 795 transitions. [2021-03-25 15:06:32,582 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8833333333333333 [2021-03-25 15:06:32,582 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 795 transitions. [2021-03-25 15:06:32,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 795 transitions. [2021-03-25 15:06:32,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:06:32,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 795 transitions. [2021-03-25 15:06:32,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 198.75) internal successors, (795), 4 states have internal predecessors, (795), 0 states have call successors, (0), 0 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-25 15:06:32,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 0 states have call successors, (0), 0 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-25 15:06:32,586 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 0 states have call successors, (0), 0 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-25 15:06:32,586 INFO L185 Difference]: Start difference. First operand has 38 places, 23 transitions, 72 flow. Second operand 4 states and 795 transitions. [2021-03-25 15:06:32,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 24 transitions, 85 flow [2021-03-25 15:06:32,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 24 transitions, 81 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 15:06:32,589 INFO L241 Difference]: Finished difference. Result has 41 places, 23 transitions, 82 flow [2021-03-25 15:06:32,589 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=41, PETRI_TRANSITIONS=23} [2021-03-25 15:06:32,589 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -15 predicate places. [2021-03-25 15:06:32,589 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:06:32,589 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 23 transitions, 82 flow [2021-03-25 15:06:32,589 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 23 transitions, 82 flow [2021-03-25 15:06:32,590 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 23 transitions, 82 flow [2021-03-25 15:06:32,594 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-25 15:06:32,594 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-03-25 15:06:32,594 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 23 events. 0/23 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 15:06:32,595 INFO L142 LiptonReduction]: Number of co-enabled transitions 206 [2021-03-25 15:06:32,620 INFO L154 LiptonReduction]: Checked pairs total: 329 [2021-03-25 15:06:32,620 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 15:06:32,620 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 31 [2021-03-25 15:06:32,622 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 22 transitions, 80 flow [2021-03-25 15:06:32,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 0 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-25 15:06:32,623 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:06:32,623 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:06:32,623 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 15:06:32,623 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:06:32,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:06:32,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1464333631, now seen corresponding path program 1 times [2021-03-25 15:06:32,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:06:32,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523991054] [2021-03-25 15:06:32,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:06:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:06:32,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:32,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:06:32,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:32,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:06:32,698 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-25 15:06:32,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523991054] [2021-03-25 15:06:32,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:06:32,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 15:06:32,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482772488] [2021-03-25 15:06:32,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 15:06:32,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:06:32,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 15:06:32,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 15:06:32,700 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 226 [2021-03-25 15:06:32,701 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 22 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 0 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-25 15:06:32,701 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:06:32,701 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 226 [2021-03-25 15:06:32,701 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:06:32,717 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2021-03-25 15:06:32,717 INFO L130 PetriNetUnfolder]: For 49/62 co-relation queries the response was YES. [2021-03-25 15:06:32,717 INFO L84 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 30 events. 0/30 cut-off events. For 49/62 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 3/33 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-25 15:06:32,717 INFO L132 encePairwiseOnDemand]: 222/226 looper letters, 1 selfloop transitions, 3 changer transitions 1/23 dead transitions. [2021-03-25 15:06:32,717 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 23 transitions, 97 flow [2021-03-25 15:06:32,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 15:06:32,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 15:06:32,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 795 transitions. [2021-03-25 15:06:32,719 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.879424778761062 [2021-03-25 15:06:32,719 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 795 transitions. [2021-03-25 15:06:32,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 795 transitions. [2021-03-25 15:06:32,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:06:32,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 795 transitions. [2021-03-25 15:06:32,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 198.75) internal successors, (795), 4 states have internal predecessors, (795), 0 states have call successors, (0), 0 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-25 15:06:32,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 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-25 15:06:32,722 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 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-25 15:06:32,723 INFO L185 Difference]: Start difference. First operand has 40 places, 22 transitions, 80 flow. Second operand 4 states and 795 transitions. [2021-03-25 15:06:32,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 23 transitions, 97 flow [2021-03-25 15:06:32,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 23 transitions, 77 flow, removed 3 selfloop flow, removed 5 redundant places. [2021-03-25 15:06:32,724 INFO L241 Difference]: Finished difference. Result has 40 places, 22 transitions, 78 flow [2021-03-25 15:06:32,724 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=40, PETRI_TRANSITIONS=22} [2021-03-25 15:06:32,725 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -16 predicate places. [2021-03-25 15:06:32,725 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:06:32,725 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 22 transitions, 78 flow [2021-03-25 15:06:32,725 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 22 transitions, 78 flow [2021-03-25 15:06:32,725 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 22 transitions, 78 flow [2021-03-25 15:06:32,728 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-25 15:06:32,728 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-03-25 15:06:32,728 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 22 events. 0/22 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 15:06:32,730 INFO L142 LiptonReduction]: Number of co-enabled transitions 150 [2021-03-25 15:06:32,753 INFO L154 LiptonReduction]: Checked pairs total: 215 [2021-03-25 15:06:32,753 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 15:06:32,753 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 28 [2021-03-25 15:06:32,758 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 21 transitions, 76 flow [2021-03-25 15:06:32,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 0 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-25 15:06:32,758 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:06:32,758 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:06:32,758 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 15:06:32,759 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:06:32,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:06:32,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1168774606, now seen corresponding path program 1 times [2021-03-25 15:06:32,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:06:32,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427081043] [2021-03-25 15:06:32,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:06:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:06:32,878 INFO L142 QuantifierPusher]: treesize reduction 9, result has 75.7 percent of original size [2021-03-25 15:06:32,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 15:06:32,890 INFO L142 QuantifierPusher]: treesize reduction 9, result has 75.7 percent of original size [2021-03-25 15:06:32,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 15:06:32,892 INFO L142 QuantifierPusher]: treesize reduction 13, result has 63.9 percent of original size [2021-03-25 15:06:32,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 15:06:32,904 INFO L142 QuantifierPusher]: treesize reduction 12, result has 70.0 percent of original size [2021-03-25 15:06:32,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 15:06:32,916 INFO L142 QuantifierPusher]: treesize reduction 15, result has 44.4 percent of original size [2021-03-25 15:06:32,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 15:06:32,924 INFO L142 QuantifierPusher]: treesize reduction 9, result has 62.5 percent of original size [2021-03-25 15:06:32,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 15:06:32,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-25 15:06:32,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427081043] [2021-03-25 15:06:32,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:06:32,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 15:06:32,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415898832] [2021-03-25 15:06:32,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 15:06:32,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:06:32,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 15:06:32,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 15:06:32,935 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 227 [2021-03-25 15:06:32,936 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 21 transitions, 76 flow. Second operand has 7 states, 7 states have (on average 146.0) internal successors, (1022), 7 states have internal predecessors, (1022), 0 states have call successors, (0), 0 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-25 15:06:32,936 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:06:32,936 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 227 [2021-03-25 15:06:32,936 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:06:33,009 INFO L129 PetriNetUnfolder]: 9/67 cut-off events. [2021-03-25 15:06:33,009 INFO L130 PetriNetUnfolder]: For 56/57 co-relation queries the response was YES. [2021-03-25 15:06:33,010 INFO L84 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 67 events. 9/67 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 225 event pairs, 1 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 153. Up to 13 conditions per place. [2021-03-25 15:06:33,010 INFO L132 encePairwiseOnDemand]: 220/227 looper letters, 9 selfloop transitions, 7 changer transitions 0/28 dead transitions. [2021-03-25 15:06:33,010 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 28 transitions, 130 flow [2021-03-25 15:06:33,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 15:06:33,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 15:06:33,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 597 transitions. [2021-03-25 15:06:33,012 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6574889867841409 [2021-03-25 15:06:33,012 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 597 transitions. [2021-03-25 15:06:33,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 597 transitions. [2021-03-25 15:06:33,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:06:33,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 597 transitions. [2021-03-25 15:06:33,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.25) internal successors, (597), 4 states have internal predecessors, (597), 0 states have call successors, (0), 0 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-25 15:06:33,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 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-25 15:06:33,014 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 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-25 15:06:33,015 INFO L185 Difference]: Start difference. First operand has 39 places, 21 transitions, 76 flow. Second operand 4 states and 597 transitions. [2021-03-25 15:06:33,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 28 transitions, 130 flow [2021-03-25 15:06:33,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 28 transitions, 108 flow, removed 6 selfloop flow, removed 5 redundant places. [2021-03-25 15:06:33,017 INFO L241 Difference]: Finished difference. Result has 38 places, 25 transitions, 95 flow [2021-03-25 15:06:33,017 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2021-03-25 15:06:33,017 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -18 predicate places. [2021-03-25 15:06:33,018 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:06:33,018 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 25 transitions, 95 flow [2021-03-25 15:06:33,018 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 25 transitions, 95 flow [2021-03-25 15:06:33,018 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 25 transitions, 95 flow [2021-03-25 15:06:33,024 INFO L129 PetriNetUnfolder]: 3/49 cut-off events. [2021-03-25 15:06:33,024 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-25 15:06:33,024 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 49 events. 3/49 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 156 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 92. Up to 11 conditions per place. [2021-03-25 15:06:33,024 INFO L142 LiptonReduction]: Number of co-enabled transitions 156 [2021-03-25 15:06:34,559 INFO L154 LiptonReduction]: Checked pairs total: 219 [2021-03-25 15:06:34,559 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 15:06:34,559 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1541 [2021-03-25 15:06:34,560 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 97 flow [2021-03-25 15:06:34,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 146.0) internal successors, (1022), 7 states have internal predecessors, (1022), 0 states have call successors, (0), 0 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-25 15:06:34,560 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:06:34,560 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:06:34,560 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 15:06:34,560 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:06:34,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:06:34,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1914878647, now seen corresponding path program 1 times [2021-03-25 15:06:34,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:06:34,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433720451] [2021-03-25 15:06:34,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:06:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:06:34,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:34,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 15:06:34,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:34,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 15:06:34,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:34,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 15:06:34,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:34,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 15:06:34,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:34,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-03-25 15:06:34,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:34,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 15:06:34,774 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-25 15:06:34,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433720451] [2021-03-25 15:06:34,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:06:34,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 15:06:34,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537583118] [2021-03-25 15:06:34,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 15:06:34,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:06:34,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 15:06:34,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-03-25 15:06:34,776 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 228 [2021-03-25 15:06:34,777 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 97 flow. Second operand has 8 states, 8 states have (on average 148.875) internal successors, (1191), 8 states have internal predecessors, (1191), 0 states have call successors, (0), 0 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-25 15:06:34,777 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:06:34,777 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 228 [2021-03-25 15:06:34,777 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:06:34,886 INFO L129 PetriNetUnfolder]: 8/65 cut-off events. [2021-03-25 15:06:34,887 INFO L130 PetriNetUnfolder]: For 31/36 co-relation queries the response was YES. [2021-03-25 15:06:34,888 INFO L84 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 65 events. 8/65 cut-off events. For 31/36 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 213 event pairs, 1 based on Foata normal form. 5/69 useless extension candidates. Maximal degree in co-relation 147. Up to 13 conditions per place. [2021-03-25 15:06:34,888 INFO L132 encePairwiseOnDemand]: 223/228 looper letters, 13 selfloop transitions, 4 changer transitions 0/29 dead transitions. [2021-03-25 15:06:34,888 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 29 transitions, 143 flow [2021-03-25 15:06:34,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 15:06:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 15:06:34,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 608 transitions. [2021-03-25 15:06:34,901 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2021-03-25 15:06:34,901 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 608 transitions. [2021-03-25 15:06:34,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 608 transitions. [2021-03-25 15:06:34,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:06:34,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 608 transitions. [2021-03-25 15:06:34,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 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-25 15:06:34,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 228.0) internal successors, (1140), 5 states have internal predecessors, (1140), 0 states have call successors, (0), 0 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-25 15:06:34,903 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 228.0) internal successors, (1140), 5 states have internal predecessors, (1140), 0 states have call successors, (0), 0 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-25 15:06:34,903 INFO L185 Difference]: Start difference. First operand has 38 places, 25 transitions, 97 flow. Second operand 4 states and 608 transitions. [2021-03-25 15:06:34,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 29 transitions, 143 flow [2021-03-25 15:06:34,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 140 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 15:06:34,905 INFO L241 Difference]: Finished difference. Result has 41 places, 25 transitions, 107 flow [2021-03-25 15:06:34,906 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=107, PETRI_PLACES=41, PETRI_TRANSITIONS=25} [2021-03-25 15:06:34,906 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -15 predicate places. [2021-03-25 15:06:34,906 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:06:34,906 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 25 transitions, 107 flow [2021-03-25 15:06:34,906 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 25 transitions, 107 flow [2021-03-25 15:06:34,906 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 25 transitions, 107 flow [2021-03-25 15:06:34,912 INFO L129 PetriNetUnfolder]: 3/49 cut-off events. [2021-03-25 15:06:34,913 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-03-25 15:06:34,914 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 49 events. 3/49 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 166 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 100. Up to 11 conditions per place. [2021-03-25 15:06:34,915 INFO L142 LiptonReduction]: Number of co-enabled transitions 154 [2021-03-25 15:06:34,938 INFO L154 LiptonReduction]: Checked pairs total: 213 [2021-03-25 15:06:34,938 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 15:06:34,938 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 32 [2021-03-25 15:06:34,939 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 105 flow [2021-03-25 15:06:34,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 148.875) internal successors, (1191), 8 states have internal predecessors, (1191), 0 states have call successors, (0), 0 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-25 15:06:34,939 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:06:34,939 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:06:34,939 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 15:06:34,939 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:06:34,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:06:34,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1286558164, now seen corresponding path program 1 times [2021-03-25 15:06:34,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:06:34,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564613656] [2021-03-25 15:06:34,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:06:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:06:34,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:34,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:06:35,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:35,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:06:35,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:35,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:06:35,005 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-25 15:06:35,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564613656] [2021-03-25 15:06:35,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:06:35,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 15:06:35,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340900973] [2021-03-25 15:06:35,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 15:06:35,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:06:35,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 15:06:35,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 15:06:35,006 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 229 [2021-03-25 15:06:35,007 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 198.75) internal successors, (795), 4 states have internal predecessors, (795), 0 states have call successors, (0), 0 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-25 15:06:35,007 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:06:35,007 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 229 [2021-03-25 15:06:35,007 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:06:35,056 INFO L129 PetriNetUnfolder]: 127/269 cut-off events. [2021-03-25 15:06:35,056 INFO L130 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2021-03-25 15:06:35,057 INFO L84 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 269 events. 127/269 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1279 event pairs, 59 based on Foata normal form. 24/272 useless extension candidates. Maximal degree in co-relation 585. Up to 179 conditions per place. [2021-03-25 15:06:35,058 INFO L132 encePairwiseOnDemand]: 222/229 looper letters, 9 selfloop transitions, 9 changer transitions 2/37 dead transitions. [2021-03-25 15:06:35,058 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 37 transitions, 171 flow [2021-03-25 15:06:35,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 15:06:35,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 15:06:35,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1012 transitions. [2021-03-25 15:06:35,061 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8838427947598253 [2021-03-25 15:06:35,061 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1012 transitions. [2021-03-25 15:06:35,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1012 transitions. [2021-03-25 15:06:35,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:06:35,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1012 transitions. [2021-03-25 15:06:35,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 202.4) internal successors, (1012), 5 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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-25 15:06:35,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 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-25 15:06:35,065 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 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-25 15:06:35,065 INFO L185 Difference]: Start difference. First operand has 40 places, 24 transitions, 105 flow. Second operand 5 states and 1012 transitions. [2021-03-25 15:06:35,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 37 transitions, 171 flow [2021-03-25 15:06:35,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 156 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-25 15:06:35,067 INFO L241 Difference]: Finished difference. Result has 43 places, 32 transitions, 159 flow [2021-03-25 15:06:35,067 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2021-03-25 15:06:35,068 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -13 predicate places. [2021-03-25 15:06:35,068 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:06:35,068 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 32 transitions, 159 flow [2021-03-25 15:06:35,068 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 32 transitions, 159 flow [2021-03-25 15:06:35,068 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 32 transitions, 159 flow [2021-03-25 15:06:35,089 INFO L129 PetriNetUnfolder]: 124/255 cut-off events. [2021-03-25 15:06:35,089 INFO L130 PetriNetUnfolder]: For 123/199 co-relation queries the response was YES. [2021-03-25 15:06:35,090 INFO L84 FinitePrefix]: Finished finitePrefix Result has 730 conditions, 255 events. 124/255 cut-off events. For 123/199 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1231 event pairs, 59 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 717. Up to 193 conditions per place. [2021-03-25 15:06:35,091 INFO L142 LiptonReduction]: Number of co-enabled transitions 200 [2021-03-25 15:06:35,718 WARN L205 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 205 [2021-03-25 15:06:36,012 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 205 [2021-03-25 15:06:37,172 WARN L205 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 285 DAG size of output: 284 [2021-03-25 15:06:37,767 WARN L205 SmtUtils]: Spent 579.00 ms on a formula simplification that was a NOOP. DAG size: 284 [2021-03-25 15:06:37,774 INFO L154 LiptonReduction]: Checked pairs total: 163 [2021-03-25 15:06:37,774 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 15:06:37,774 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2706 [2021-03-25 15:06:37,775 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 157 flow [2021-03-25 15:06:37,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 198.75) internal successors, (795), 4 states have internal predecessors, (795), 0 states have call successors, (0), 0 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-25 15:06:37,775 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:06:37,775 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:06:37,775 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 15:06:37,775 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:06:37,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:06:37,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1735295739, now seen corresponding path program 1 times [2021-03-25 15:06:37,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:06:37,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271398095] [2021-03-25 15:06:37,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:06:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:06:37,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:37,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:06:37,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:37,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:06:37,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:37,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:06:37,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:37,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:06:37,816 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-25 15:06:37,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271398095] [2021-03-25 15:06:37,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:06:37,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 15:06:37,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703375736] [2021-03-25 15:06:37,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 15:06:37,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:06:37,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 15:06:37,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 15:06:37,817 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 230 [2021-03-25 15:06:37,818 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 198.8) internal successors, (994), 5 states have internal predecessors, (994), 0 states have call successors, (0), 0 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-25 15:06:37,818 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:06:37,818 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 230 [2021-03-25 15:06:37,818 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:06:37,870 INFO L129 PetriNetUnfolder]: 94/231 cut-off events. [2021-03-25 15:06:37,870 INFO L130 PetriNetUnfolder]: For 227/424 co-relation queries the response was YES. [2021-03-25 15:06:37,871 INFO L84 FinitePrefix]: Finished finitePrefix Result has 822 conditions, 231 events. 94/231 cut-off events. For 227/424 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1031 event pairs, 16 based on Foata normal form. 34/254 useless extension candidates. Maximal degree in co-relation 807. Up to 158 conditions per place. [2021-03-25 15:06:37,872 INFO L132 encePairwiseOnDemand]: 222/230 looper letters, 9 selfloop transitions, 13 changer transitions 2/41 dead transitions. [2021-03-25 15:06:37,872 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 41 transitions, 263 flow [2021-03-25 15:06:37,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 15:06:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 15:06:37,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1214 transitions. [2021-03-25 15:06:37,874 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8797101449275362 [2021-03-25 15:06:37,874 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1214 transitions. [2021-03-25 15:06:37,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1214 transitions. [2021-03-25 15:06:37,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:06:37,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1214 transitions. [2021-03-25 15:06:37,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 202.33333333333334) internal successors, (1214), 6 states have internal predecessors, (1214), 0 states have call successors, (0), 0 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-25 15:06:37,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 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-25 15:06:37,878 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 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-25 15:06:37,878 INFO L185 Difference]: Start difference. First operand has 43 places, 31 transitions, 157 flow. Second operand 6 states and 1214 transitions. [2021-03-25 15:06:37,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 41 transitions, 263 flow [2021-03-25 15:06:37,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 41 transitions, 256 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 15:06:37,880 INFO L241 Difference]: Finished difference. Result has 47 places, 36 transitions, 242 flow [2021-03-25 15:06:37,880 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=242, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2021-03-25 15:06:37,880 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -9 predicate places. [2021-03-25 15:06:37,880 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:06:37,880 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 36 transitions, 242 flow [2021-03-25 15:06:37,880 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 36 transitions, 242 flow [2021-03-25 15:06:37,880 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 36 transitions, 242 flow [2021-03-25 15:06:37,894 INFO L129 PetriNetUnfolder]: 91/228 cut-off events. [2021-03-25 15:06:37,894 INFO L130 PetriNetUnfolder]: For 418/572 co-relation queries the response was YES. [2021-03-25 15:06:37,895 INFO L84 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 228 events. 91/228 cut-off events. For 418/572 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1059 event pairs, 16 based on Foata normal form. 5/223 useless extension candidates. Maximal degree in co-relation 910. Up to 155 conditions per place. [2021-03-25 15:06:37,896 INFO L142 LiptonReduction]: Number of co-enabled transitions 208 [2021-03-25 15:06:37,935 INFO L154 LiptonReduction]: Checked pairs total: 141 [2021-03-25 15:06:37,936 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 15:06:37,936 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 56 [2021-03-25 15:06:37,936 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 236 flow [2021-03-25 15:06:37,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 198.8) internal successors, (994), 5 states have internal predecessors, (994), 0 states have call successors, (0), 0 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-25 15:06:37,936 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:06:37,937 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:06:37,937 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 15:06:37,937 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:06:37,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:06:37,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1510005594, now seen corresponding path program 1 times [2021-03-25 15:06:37,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:06:37,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825597732] [2021-03-25 15:06:37,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:06:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:06:37,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:37,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:06:37,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:37,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:06:37,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:37,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:06:37,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:37,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:06:37,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:37,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:06:37,977 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-25 15:06:37,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825597732] [2021-03-25 15:06:37,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:06:37,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 15:06:37,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507847662] [2021-03-25 15:06:37,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 15:06:37,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:06:37,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 15:06:37,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 15:06:37,979 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 231 [2021-03-25 15:06:37,979 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 198.83333333333334) internal successors, (1193), 6 states have internal predecessors, (1193), 0 states have call successors, (0), 0 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-25 15:06:37,979 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:06:37,979 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 231 [2021-03-25 15:06:37,980 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:06:38,039 INFO L129 PetriNetUnfolder]: 56/167 cut-off events. [2021-03-25 15:06:38,039 INFO L130 PetriNetUnfolder]: For 454/585 co-relation queries the response was YES. [2021-03-25 15:06:38,039 INFO L84 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 167 events. 56/167 cut-off events. For 454/585 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 703 event pairs, 2 based on Foata normal form. 37/197 useless extension candidates. Maximal degree in co-relation 733. Up to 103 conditions per place. [2021-03-25 15:06:38,040 INFO L132 encePairwiseOnDemand]: 222/231 looper letters, 6 selfloop transitions, 17 changer transitions 5/45 dead transitions. [2021-03-25 15:06:38,040 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 45 transitions, 388 flow [2021-03-25 15:06:38,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 15:06:38,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 15:06:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1416 transitions. [2021-03-25 15:06:38,043 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.87569573283859 [2021-03-25 15:06:38,043 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1416 transitions. [2021-03-25 15:06:38,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1416 transitions. [2021-03-25 15:06:38,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:06:38,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1416 transitions. [2021-03-25 15:06:38,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 202.28571428571428) internal successors, (1416), 7 states have internal predecessors, (1416), 0 states have call successors, (0), 0 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-25 15:06:38,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:06:38,047 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:06:38,047 INFO L185 Difference]: Start difference. First operand has 47 places, 35 transitions, 236 flow. Second operand 7 states and 1416 transitions. [2021-03-25 15:06:38,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 45 transitions, 388 flow [2021-03-25 15:06:38,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 45 transitions, 326 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-25 15:06:38,049 INFO L241 Difference]: Finished difference. Result has 50 places, 40 transitions, 296 flow [2021-03-25 15:06:38,049 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=296, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2021-03-25 15:06:38,049 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -6 predicate places. [2021-03-25 15:06:38,049 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:06:38,050 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 40 transitions, 296 flow [2021-03-25 15:06:38,050 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 40 transitions, 296 flow [2021-03-25 15:06:38,050 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 296 flow [2021-03-25 15:06:38,060 INFO L129 PetriNetUnfolder]: 50/160 cut-off events. [2021-03-25 15:06:38,060 INFO L130 PetriNetUnfolder]: For 350/382 co-relation queries the response was YES. [2021-03-25 15:06:38,061 INFO L84 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 160 events. 50/160 cut-off events. For 350/382 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 677 event pairs, 2 based on Foata normal form. 5/159 useless extension candidates. Maximal degree in co-relation 611. Up to 85 conditions per place. [2021-03-25 15:06:38,062 INFO L142 LiptonReduction]: Number of co-enabled transitions 190 [2021-03-25 15:06:38,066 INFO L154 LiptonReduction]: Checked pairs total: 112 [2021-03-25 15:06:38,066 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 15:06:38,066 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17 [2021-03-25 15:06:38,066 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 286 flow [2021-03-25 15:06:38,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 198.83333333333334) internal successors, (1193), 6 states have internal predecessors, (1193), 0 states have call successors, (0), 0 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-25 15:06:38,067 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:06:38,067 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:06:38,067 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 15:06:38,067 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:06:38,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:06:38,067 INFO L82 PathProgramCache]: Analyzing trace with hash -503942038, now seen corresponding path program 1 times [2021-03-25 15:06:38,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:06:38,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714283127] [2021-03-25 15:06:38,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:06:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:06:38,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:38,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:06:38,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:38,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:06:38,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:38,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:06:38,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:38,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:06:38,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:38,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:06:38,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:06:38,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:06:38,117 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-25 15:06:38,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714283127] [2021-03-25 15:06:38,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:06:38,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 15:06:38,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122854560] [2021-03-25 15:06:38,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 15:06:38,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:06:38,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 15:06:38,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 15:06:38,120 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 231 [2021-03-25 15:06:38,121 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 286 flow. Second operand has 7 states, 7 states have (on average 198.85714285714286) internal successors, (1392), 7 states have internal predecessors, (1392), 0 states have call successors, (0), 0 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-25 15:06:38,121 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:06:38,121 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 231 [2021-03-25 15:06:38,121 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:06:38,177 INFO L129 PetriNetUnfolder]: 38/126 cut-off events. [2021-03-25 15:06:38,178 INFO L130 PetriNetUnfolder]: For 392/454 co-relation queries the response was YES. [2021-03-25 15:06:38,178 INFO L84 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 126 events. 38/126 cut-off events. For 392/454 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 485 event pairs, 0 based on Foata normal form. 33/153 useless extension candidates. Maximal degree in co-relation 513. Up to 59 conditions per place. [2021-03-25 15:06:38,179 INFO L132 encePairwiseOnDemand]: 222/231 looper letters, 2 selfloop transitions, 18 changer transitions 4/41 dead transitions. [2021-03-25 15:06:38,179 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 41 transitions, 348 flow [2021-03-25 15:06:38,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 15:06:38,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 15:06:38,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1610 transitions. [2021-03-25 15:06:38,203 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8712121212121212 [2021-03-25 15:06:38,203 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1610 transitions. [2021-03-25 15:06:38,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1610 transitions. [2021-03-25 15:06:38,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:06:38,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1610 transitions. [2021-03-25 15:06:38,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 201.25) internal successors, (1610), 8 states have internal predecessors, (1610), 0 states have call successors, (0), 0 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-25 15:06:38,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 231.0) internal successors, (2079), 9 states have internal predecessors, (2079), 0 states have call successors, (0), 0 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-25 15:06:38,209 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 231.0) internal successors, (2079), 9 states have internal predecessors, (2079), 0 states have call successors, (0), 0 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-25 15:06:38,209 INFO L185 Difference]: Start difference. First operand has 50 places, 39 transitions, 286 flow. Second operand 8 states and 1610 transitions. [2021-03-25 15:06:38,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 41 transitions, 348 flow [2021-03-25 15:06:38,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 41 transitions, 298 flow, removed 17 selfloop flow, removed 5 redundant places. [2021-03-25 15:06:38,211 INFO L241 Difference]: Finished difference. Result has 53 places, 37 transitions, 262 flow [2021-03-25 15:06:38,211 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=262, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2021-03-25 15:06:38,211 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -3 predicate places. [2021-03-25 15:06:38,211 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:06:38,211 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 37 transitions, 262 flow [2021-03-25 15:06:38,211 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 37 transitions, 262 flow [2021-03-25 15:06:38,211 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 37 transitions, 262 flow [2021-03-25 15:06:38,220 INFO L129 PetriNetUnfolder]: 35/122 cut-off events. [2021-03-25 15:06:38,220 INFO L130 PetriNetUnfolder]: For 238/245 co-relation queries the response was YES. [2021-03-25 15:06:38,220 INFO L84 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 122 events. 35/122 cut-off events. For 238/245 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 508 event pairs, 0 based on Foata normal form. 3/122 useless extension candidates. Maximal degree in co-relation 423. Up to 37 conditions per place. [2021-03-25 15:06:38,221 INFO L142 LiptonReduction]: Number of co-enabled transitions 148 [2021-03-25 15:06:38,412 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 82 [2021-03-25 15:06:38,822 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 105 [2021-03-25 15:06:38,955 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-03-25 15:06:39,151 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 82 [2021-03-25 15:06:39,556 WARN L205 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 105 [2021-03-25 15:06:39,678 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-03-25 15:06:39,979 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 15:06:40,110 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 15:06:40,260 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2021-03-25 15:06:40,400 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2021-03-25 15:06:40,642 WARN L205 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2021-03-25 15:06:40,911 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2021-03-25 15:06:40,915 INFO L154 LiptonReduction]: Checked pairs total: 19 [2021-03-25 15:06:40,915 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 15:06:40,915 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2704 [2021-03-25 15:06:40,915 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 244 flow [2021-03-25 15:06:40,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 198.85714285714286) internal successors, (1392), 7 states have internal predecessors, (1392), 0 states have call successors, (0), 0 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-25 15:06:40,916 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:06:40,916 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:06:40,916 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 15:06:40,916 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:06:40,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:06:40,916 INFO L82 PathProgramCache]: Analyzing trace with hash 79088281, now seen corresponding path program 1 times [2021-03-25 15:06:40,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:06:40,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510568625] [2021-03-25 15:06:40,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:06:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 15:06:40,939 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 15:06:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 15:06:40,963 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 15:06:40,984 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 15:06:40,985 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 15:06:40,985 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 15:06:41,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 03:06:41 BasicIcfg [2021-03-25 15:06:41,079 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 15:06:41,080 INFO L168 Benchmark]: Toolchain (without parser) took 27811.55 ms. Allocated memory was 352.3 MB in the beginning and 805.3 MB in the end (delta: 453.0 MB). Free memory was 315.6 MB in the beginning and 697.9 MB in the end (delta: -382.3 MB). Peak memory consumption was 73.6 MB. Max. memory is 16.0 GB. [2021-03-25 15:06:41,080 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 352.3 MB. Free memory was 333.9 MB in the beginning and 333.8 MB in the end (delta: 76.8 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 15:06:41,080 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.25 ms. Allocated memory is still 352.3 MB. Free memory was 315.4 MB in the beginning and 312.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 16.0 GB. [2021-03-25 15:06:41,081 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.97 ms. Allocated memory is still 352.3 MB. Free memory was 312.0 MB in the beginning and 309.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 15:06:41,082 INFO L168 Benchmark]: Boogie Preprocessor took 27.40 ms. Allocated memory is still 352.3 MB. Free memory was 309.9 MB in the beginning and 307.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 15:06:41,084 INFO L168 Benchmark]: RCFGBuilder took 1486.78 ms. Allocated memory is still 352.3 MB. Free memory was 307.8 MB in the beginning and 259.3 MB in the end (delta: 48.5 MB). Peak memory consumption was 135.5 MB. Max. memory is 16.0 GB. [2021-03-25 15:06:41,087 INFO L168 Benchmark]: TraceAbstraction took 25915.81 ms. Allocated memory was 352.3 MB in the beginning and 805.3 MB in the end (delta: 453.0 MB). Free memory was 258.2 MB in the beginning and 697.9 MB in the end (delta: -439.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 16.0 GB. [2021-03-25 15:06:41,087 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.10 ms. Allocated memory is still 352.3 MB. Free memory was 333.9 MB in the beginning and 333.8 MB in the end (delta: 76.8 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 338.25 ms. Allocated memory is still 352.3 MB. Free memory was 315.4 MB in the beginning and 312.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 38.97 ms. Allocated memory is still 352.3 MB. Free memory was 312.0 MB in the beginning and 309.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 27.40 ms. Allocated memory is still 352.3 MB. Free memory was 309.9 MB in the beginning and 307.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1486.78 ms. Allocated memory is still 352.3 MB. Free memory was 307.8 MB in the beginning and 259.3 MB in the end (delta: 48.5 MB). Peak memory consumption was 135.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 25915.81 ms. Allocated memory was 352.3 MB in the beginning and 805.3 MB in the end (delta: 453.0 MB). Free memory was 258.2 MB in the beginning and 697.9 MB in the end (delta: -439.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7168.8ms, 127 PlacesBefore, 56 PlacesAfterwards, 115 TransitionsBefore, 44 TransitionsAfterwards, 1506 CoEnabledTransitionPairs, 5 FixpointIterations, 45 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 74 TotalNumberOfCompositions, 2448 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1320, positive: 1249, positive conditional: 0, positive unconditional: 1249, negative: 71, negative conditional: 0, negative unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 978, positive: 938, positive conditional: 0, positive unconditional: 938, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 978, positive: 938, positive conditional: 0, positive unconditional: 938, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 978, positive: 928, positive conditional: 0, positive unconditional: 928, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 50, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1744, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 385, negative conditional: 0, negative unconditional: 385, unknown: 1336, unknown conditional: 0, unknown unconditional: 1336] ], Cache Queries: [ total: 1320, positive: 311, positive conditional: 0, positive unconditional: 311, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 978, unknown conditional: 0, unknown unconditional: 978] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 150, Positive conditional cache size: 0, Positive unconditional cache size: 150, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3150.2ms, 58 PlacesBefore, 39 PlacesAfterwards, 41 TransitionsBefore, 25 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 5 FixpointIterations, 15 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 16 TotalNumberOfCompositions, 1531 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 638, positive: 537, positive conditional: 0, positive unconditional: 537, negative: 101, negative conditional: 0, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 68, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 68, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 754, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 605, unknown conditional: 0, unknown unconditional: 605] ], Cache Queries: [ total: 638, positive: 482, positive conditional: 0, positive unconditional: 482, negative: 88, negative conditional: 0, negative unconditional: 88, unknown: 68, unknown conditional: 0, unknown unconditional: 68] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 184, Positive conditional cache size: 0, Positive unconditional cache size: 184, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1553.3ms, 38 PlacesBefore, 37 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 272 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 572 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 270, positive: 232, positive conditional: 0, positive unconditional: 232, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 270, positive: 223, positive conditional: 0, positive unconditional: 223, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 214, Positive cache size: 193, Positive conditional cache size: 0, Positive unconditional cache size: 193, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1663.6ms, 40 PlacesBefore, 39 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 256 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 445 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 181, positive: 149, positive conditional: 0, positive unconditional: 149, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 181, positive: 148, positive conditional: 0, positive unconditional: 148, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 155, Positive conditional cache size: 0, Positive unconditional cache size: 155, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2994.7ms, 38 PlacesBefore, 38 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 224 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 197 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 89, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2990, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2990, unknown conditional: 0, unknown unconditional: 2990] ], Cache Queries: [ total: 89, positive: 70, positive conditional: 0, positive unconditional: 70, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 159, Positive conditional cache size: 0, Positive unconditional cache size: 159, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 30.7ms, 41 PlacesBefore, 40 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 206 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 329 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 154, positive: 127, positive conditional: 0, positive unconditional: 127, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 154, positive: 125, positive conditional: 0, positive unconditional: 125, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 128, Positive conditional cache size: 0, Positive unconditional cache size: 128, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28.3ms, 40 PlacesBefore, 39 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 150 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 215 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 130, positive: 108, positive conditional: 0, positive unconditional: 108, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 130, positive: 104, positive conditional: 0, positive unconditional: 104, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 100, Positive conditional cache size: 0, Positive unconditional cache size: 100, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1541.4ms, 38 PlacesBefore, 38 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 219 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 130, positive: 109, positive conditional: 0, positive unconditional: 109, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1509, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 1501, unknown conditional: 0, unknown unconditional: 1501] ], Cache Queries: [ total: 130, positive: 106, positive conditional: 0, positive unconditional: 106, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 96, Positive conditional cache size: 0, Positive unconditional cache size: 96, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.7ms, 41 PlacesBefore, 40 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 154 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 213 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 131, positive: 111, positive conditional: 0, positive unconditional: 111, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 131, positive: 110, positive conditional: 0, positive unconditional: 110, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 85, Positive conditional cache size: 0, Positive unconditional cache size: 85, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2706.3ms, 43 PlacesBefore, 43 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 163 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 43, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 43, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 65, Positive conditional cache size: 0, Positive unconditional cache size: 65, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 55.3ms, 47 PlacesBefore, 47 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 141 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 33, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 57, Positive conditional cache size: 0, Positive unconditional cache size: 57, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.0ms, 50 PlacesBefore, 50 PlacesAfterwards, 40 TransitionsBefore, 39 TransitionsAfterwards, 190 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 112 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 57, Positive conditional cache size: 0, Positive unconditional cache size: 57, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2703.5ms, 53 PlacesBefore, 48 PlacesAfterwards, 37 TransitionsBefore, 33 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 19 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 19, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 19, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 36, Positive conditional cache size: 0, Positive unconditional cache size: 36, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p1_EAX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p3_EAX = 0; [L739] 0 int a = 0; [L740] 0 _Bool a$flush_delayed; [L741] 0 int a$mem_tmp; [L742] 0 _Bool a$r_buff0_thd0; [L743] 0 _Bool a$r_buff0_thd1; [L744] 0 _Bool a$r_buff0_thd2; [L745] 0 _Bool a$r_buff0_thd3; [L746] 0 _Bool a$r_buff0_thd4; [L747] 0 _Bool a$r_buff1_thd0; [L748] 0 _Bool a$r_buff1_thd1; [L749] 0 _Bool a$r_buff1_thd2; [L750] 0 _Bool a$r_buff1_thd3; [L751] 0 _Bool a$r_buff1_thd4; [L752] 0 _Bool a$read_delayed; [L753] 0 int *a$read_delayed_var; [L754] 0 int a$w_buff0; [L755] 0 _Bool a$w_buff0_used; [L756] 0 int a$w_buff1; [L757] 0 _Bool a$w_buff1_used; [L758] 0 _Bool main$tmp_guard0; [L759] 0 _Bool main$tmp_guard1; [L761] 0 int x = 0; [L763] 0 int y = 0; [L765] 0 int z = 0; [L766] 0 _Bool weak$$choice0; [L767] 0 _Bool weak$$choice1; [L768] 0 _Bool weak$$choice2; [L860] 0 pthread_t t2721; [L861] FCALL, FORK 0 pthread_create(&t2721, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={7: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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L862] 0 pthread_t t2722; [L772] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 1 a$flush_delayed = weak$$choice2 [L775] EXPR 1 \read(a) [L775] 1 a$mem_tmp = a [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] EXPR 1 \read(a) [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] 1 a = !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L777] EXPR 1 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)) [L777] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)) [L778] EXPR 1 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)) [L778] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)) [L779] EXPR 1 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used)) [L779] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used)) [L780] EXPR 1 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 1 weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1)) [L781] 1 a$r_buff0_thd1 = weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1)) [L782] EXPR 1 weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L782] 1 a$r_buff1_thd1 = weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L783] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L784] 1 __unbuffered_p0_EAX$read_delayed_var = &a [L785] EXPR 1 \read(a) [L785] 1 __unbuffered_p0_EAX = a [L786] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L786] 1 a = a$flush_delayed ? a$mem_tmp : a [L787] 1 a$flush_delayed = (_Bool)0 [L790] 1 x = 1 [L795] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 1 return 0; [L863] FCALL, FORK 0 pthread_create(&t2722, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={7: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, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=0, z=0] [L864] 0 pthread_t t2723; [L865] FCALL, FORK 0 pthread_create(&t2723, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={7: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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=0, z=0] [L866] 0 pthread_t t2724; [L867] FCALL, FORK 0 pthread_create(&t2724, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={7: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, 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=2, weak$$choice1=0, weak$$choice2=255, x=1, y=0, z=0] [L802] 2 __unbuffered_p1_EAX = x [L805] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={7: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, 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=2, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z=0] [L817] 3 __unbuffered_p2_EAX = y [L820] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={7: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, arg={0: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=2, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = z [L835] 4 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={7: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, arg={0:0}, arg={0: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=2, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z=1] [L838] 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) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] EXPR 4 \read(a) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] 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) [L838] 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) [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L840] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] 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 [L841] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L842] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L842] 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 [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 2 return 0; [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L845] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L847] 4 return 0; [L869] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L4] COND FALSE 0 !(!cond) [L873] 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) [L873] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L873] EXPR 0 \read(a) [L873] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L873] 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) [L873] 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) [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L875] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] 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 [L876] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L877] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L877] 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 [L880] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={7: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, arg={0:0}, arg={0: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=2, weak$$choice1=1, weak$$choice2=255, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 132 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 11.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 25730.9ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 731.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7236.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 36 SDtfs, 22 SDslu, 24 SDs, 0 SdLazy, 294 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 193.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 253.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=296occurred in iteration=11, InterpolantAutomatonStates: 57, 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: 41.3ms SsaConstructionTime, 402.8ms SatisfiabilityAnalysisTime, 623.1ms InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 1219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...