/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-OGIterative-CovSimpl-Hitting.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-13 15:42:22,599 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-13 15:42:22,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-13 15:42:22,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-13 15:42:22,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-13 15:42:22,646 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-13 15:42:22,648 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-13 15:42:22,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-13 15:42:22,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-13 15:42:22,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-13 15:42:22,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-13 15:42:22,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-13 15:42:22,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-13 15:42:22,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-13 15:42:22,665 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-13 15:42:22,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-13 15:42:22,669 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-13 15:42:22,670 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-13 15:42:22,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-13 15:42:22,680 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-13 15:42:22,681 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-13 15:42:22,683 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-13 15:42:22,684 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-13 15:42:22,686 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-13 15:42:22,692 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-13 15:42:22,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-13 15:42:22,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-13 15:42:22,694 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-13 15:42:22,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-13 15:42:22,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-13 15:42:22,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-13 15:42:22,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-13 15:42:22,697 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-13 15:42:22,698 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-13 15:42:22,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-13 15:42:22,699 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-13 15:42:22,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-13 15:42:22,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-13 15:42:22,700 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-13 15:42:22,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-13 15:42:22,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-13 15:42:22,705 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-OGIterative-CovSimpl-Hitting.epf [2021-08-13 15:42:22,739 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-13 15:42:22,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-13 15:42:22,741 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-13 15:42:22,741 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-13 15:42:22,741 INFO L138 SettingsManager]: * Use SBE=true [2021-08-13 15:42:22,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-13 15:42:22,742 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-13 15:42:22,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-13 15:42:22,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-13 15:42:22,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-13 15:42:22,742 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-13 15:42:22,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-13 15:42:22,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-13 15:42:22,742 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-13 15:42:22,743 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-13 15:42:22,743 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-13 15:42:22,743 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-13 15:42:22,743 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-13 15:42:22,743 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-13 15:42:22,743 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-13 15:42:22,744 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-13 15:42:22,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 15:42:22,744 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-13 15:42:22,744 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-13 15:42:22,744 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-13 15:42:22,744 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-13 15:42:22,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-13 15:42:22,745 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-13 15:42:22,745 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-13 15:42:22,745 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-13 15:42:22,745 INFO L138 SettingsManager]: * Compute cosets for OwickiGries annotation iteratively=true [2021-08-13 15:42:22,745 INFO L138 SettingsManager]: * Use hitting sets in computation of OwickiGries annotation=true [2021-08-13 15:42:22,746 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-13 15:42:22,746 INFO L138 SettingsManager]: * Simplify away covered predicates in OwickiGries annotation=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-08-13 15:42:23,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-13 15:42:23,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-13 15:42:23,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-13 15:42:23,100 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-13 15:42:23,101 INFO L275 PluginConnector]: CDTParser initialized [2021-08-13 15:42:23,102 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i [2021-08-13 15:42:23,167 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d1acff4a/a5edd9ee67304775998457679b40fe17/FLAGc2bd399fa [2021-08-13 15:42:23,704 INFO L306 CDTParser]: Found 1 translation units. [2021-08-13 15:42:23,704 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i [2021-08-13 15:42:23,722 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d1acff4a/a5edd9ee67304775998457679b40fe17/FLAGc2bd399fa [2021-08-13 15:42:24,179 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d1acff4a/a5edd9ee67304775998457679b40fe17 [2021-08-13 15:42:24,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-13 15:42:24,183 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-13 15:42:24,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-13 15:42:24,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-13 15:42:24,192 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-13 15:42:24,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 03:42:24" (1/1) ... [2021-08-13 15:42:24,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c3c6ba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:42:24, skipping insertion in model container [2021-08-13 15:42:24,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 03:42:24" (1/1) ... [2021-08-13 15:42:24,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-13 15:42:24,239 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-13 15:42:24,348 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i[949,962] [2021-08-13 15:42:24,585 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 15:42:24,593 INFO L203 MainTranslator]: Completed pre-run [2021-08-13 15:42:24,603 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i[949,962] [2021-08-13 15:42:24,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 15:42:24,710 INFO L208 MainTranslator]: Completed translation [2021-08-13 15:42:24,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:42:24 WrapperNode [2021-08-13 15:42:24,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-13 15:42:24,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-13 15:42:24,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-13 15:42:24,712 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-13 15:42:24,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:42:24" (1/1) ... [2021-08-13 15:42:24,732 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:42:24" (1/1) ... [2021-08-13 15:42:24,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-13 15:42:24,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-13 15:42:24,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-13 15:42:24,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-13 15:42:24,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:42:24" (1/1) ... [2021-08-13 15:42:24,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:42:24" (1/1) ... [2021-08-13 15:42:24,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:42:24" (1/1) ... [2021-08-13 15:42:24,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:42:24" (1/1) ... [2021-08-13 15:42:24,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:42:24" (1/1) ... [2021-08-13 15:42:24,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:42:24" (1/1) ... [2021-08-13 15:42:24,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:42:24" (1/1) ... [2021-08-13 15:42:24,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-13 15:42:24,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-13 15:42:24,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-13 15:42:24,794 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-13 15:42:24,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:42:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 15:42:24,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-13 15:42:24,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-13 15:42:24,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-13 15:42:24,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-13 15:42:24,857 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-13 15:42:24,857 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-13 15:42:24,857 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-13 15:42:24,857 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-13 15:42:24,857 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-13 15:42:24,857 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-13 15:42:24,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-13 15:42:24,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-13 15:42:24,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-13 15:42:24,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-13 15:42:24,859 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-13 15:42:26,740 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-13 15:42:26,741 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-13 15:42:26,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 03:42:26 BoogieIcfgContainer [2021-08-13 15:42:26,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-13 15:42:26,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-13 15:42:26,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-13 15:42:26,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-13 15:42:26,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.08 03:42:24" (1/3) ... [2021-08-13 15:42:26,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5353a4b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 03:42:26, skipping insertion in model container [2021-08-13 15:42:26,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:42:24" (2/3) ... [2021-08-13 15:42:26,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5353a4b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 03:42:26, skipping insertion in model container [2021-08-13 15:42:26,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 03:42:26" (3/3) ... [2021-08-13 15:42:26,751 INFO L111 eAbstractionObserver]: Analyzing ICFG safe004_rmo.opt.i [2021-08-13 15:42:26,757 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-13 15:42:26,758 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-13 15:42:26,758 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-13 15:42:26,792 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,793 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,793 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,794 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,794 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,799 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,800 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,800 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,801 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,801 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,801 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,802 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,802 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,802 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,802 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,802 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,807 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,807 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,807 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,807 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,816 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,816 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,820 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,821 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,821 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,827 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,828 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,828 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:42:26,831 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-13 15:42:26,855 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-13 15:42:26,876 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-13 15:42:26,876 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-13 15:42:26,876 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-13 15:42:26,876 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-13 15:42:26,876 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-13 15:42:26,876 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-13 15:42:26,876 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-13 15:42:26,876 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-13 15:42:26,892 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2021-08-13 15:42:26,933 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2021-08-13 15:42:26,933 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 15:42:26,937 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2021-08-13 15:42:26,937 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2021-08-13 15:42:26,941 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2021-08-13 15:42:26,952 INFO L129 PetriNetUnfolder]: 0/56 cut-off events. [2021-08-13 15:42:26,952 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 15:42:26,953 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:42:26,953 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:42:26,954 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:42:26,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:42:26,958 INFO L82 PathProgramCache]: Analyzing trace with hash -591144752, now seen corresponding path program 1 times [2021-08-13 15:42:26,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:42:26,966 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314674499] [2021-08-13 15:42:26,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:42:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:42:27,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:27,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:42:27,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:27,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:42:27,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:42:27,210 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:42:27,211 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314674499] [2021-08-13 15:42:27,212 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314674499] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:42:27,212 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:42:27,212 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-13 15:42:27,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233031192] [2021-08-13 15:42:27,222 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-13 15:42:27,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:42:27,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-13 15:42:27,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-13 15:42:27,240 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 106 [2021-08-13 15:42:27,249 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:27,249 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:42:27,249 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 106 [2021-08-13 15:42:27,251 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:42:27,389 INFO L129 PetriNetUnfolder]: 49/388 cut-off events. [2021-08-13 15:42:27,390 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 15:42:27,392 INFO L84 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 388 events. 49/388 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1957 event pairs, 27 based on Foata normal form. 18/382 useless extension candidates. Maximal degree in co-relation 437. Up to 65 conditions per place. [2021-08-13 15:42:27,395 INFO L132 encePairwiseOnDemand]: 101/106 looper letters, 9 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2021-08-13 15:42:27,396 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 103 transitions, 237 flow [2021-08-13 15:42:27,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-13 15:42:27,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-13 15:42:27,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2021-08-13 15:42:27,407 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9465408805031447 [2021-08-13 15:42:27,408 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 301 transitions. [2021-08-13 15:42:27,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 301 transitions. [2021-08-13 15:42:27,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:42:27,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 301 transitions. [2021-08-13 15:42:27,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:27,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:27,422 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:27,422 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 0 predicate places. [2021-08-13 15:42:27,423 INFO L482 AbstractCegarLoop]: Abstraction has has 111 places, 103 transitions, 237 flow [2021-08-13 15:42:27,423 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:27,423 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:42:27,423 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:42:27,423 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-13 15:42:27,424 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:42:27,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:42:27,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1192679358, now seen corresponding path program 1 times [2021-08-13 15:42:27,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:42:27,425 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349777887] [2021-08-13 15:42:27,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:42:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:42:27,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:27,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:42:27,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:27,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:42:27,637 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:42:27,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:42:27,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:27,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:42:27,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:27,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:42:27,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:27,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:42:27,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:42:27,669 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:42:27,670 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349777887] [2021-08-13 15:42:27,670 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349777887] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:42:27,670 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:42:27,670 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 15:42:27,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848722161] [2021-08-13 15:42:27,671 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 15:42:27,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:42:27,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 15:42:27,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 15:42:27,674 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 106 [2021-08-13 15:42:27,674 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:27,674 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:42:27,675 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 106 [2021-08-13 15:42:27,675 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:42:27,851 INFO L129 PetriNetUnfolder]: 101/680 cut-off events. [2021-08-13 15:42:27,851 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-08-13 15:42:27,855 INFO L84 FinitePrefix]: Finished finitePrefix Result has 988 conditions, 680 events. 101/680 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4809 event pairs, 39 based on Foata normal form. 0/656 useless extension candidates. Maximal degree in co-relation 938. Up to 105 conditions per place. [2021-08-13 15:42:27,857 INFO L132 encePairwiseOnDemand]: 100/106 looper letters, 8 selfloop transitions, 2 changer transitions 13/116 dead transitions. [2021-08-13 15:42:27,857 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 116 transitions, 313 flow [2021-08-13 15:42:27,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 15:42:27,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 15:42:27,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 869 transitions. [2021-08-13 15:42:27,862 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.910901467505241 [2021-08-13 15:42:27,862 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 869 transitions. [2021-08-13 15:42:27,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 869 transitions. [2021-08-13 15:42:27,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:42:27,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 869 transitions. [2021-08-13 15:42:27,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.55555555555556) internal successors, (869), 9 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:27,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:27,870 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:27,871 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 8 predicate places. [2021-08-13 15:42:27,871 INFO L482 AbstractCegarLoop]: Abstraction has has 119 places, 116 transitions, 313 flow [2021-08-13 15:42:27,871 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:27,871 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:42:27,871 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:42:27,871 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-13 15:42:27,872 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:42:27,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:42:27,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1133217032, now seen corresponding path program 1 times [2021-08-13 15:42:27,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:42:27,873 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712912804] [2021-08-13 15:42:27,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:42:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:42:28,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:28,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:42:28,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:28,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:42:28,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:28,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:42:28,076 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:42:28,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:42:28,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:28,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:42:28,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:28,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:42:28,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:28,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:42:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:42:28,119 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:42:28,120 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712912804] [2021-08-13 15:42:28,120 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712912804] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:42:28,120 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:42:28,120 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 15:42:28,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653077830] [2021-08-13 15:42:28,121 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 15:42:28,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:42:28,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 15:42:28,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-13 15:42:28,126 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 106 [2021-08-13 15:42:28,127 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 116 transitions, 313 flow. Second operand has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:28,127 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:42:28,127 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 106 [2021-08-13 15:42:28,127 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:42:28,749 INFO L129 PetriNetUnfolder]: 589/2383 cut-off events. [2021-08-13 15:42:28,750 INFO L130 PetriNetUnfolder]: For 150/240 co-relation queries the response was YES. [2021-08-13 15:42:28,762 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4176 conditions, 2383 events. 589/2383 cut-off events. For 150/240 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 22494 event pairs, 125 based on Foata normal form. 12/2300 useless extension candidates. Maximal degree in co-relation 4122. Up to 386 conditions per place. [2021-08-13 15:42:28,767 INFO L132 encePairwiseOnDemand]: 97/106 looper letters, 15 selfloop transitions, 5 changer transitions 66/175 dead transitions. [2021-08-13 15:42:28,768 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 175 transitions, 675 flow [2021-08-13 15:42:28,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 15:42:28,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 15:42:28,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1235 transitions. [2021-08-13 15:42:28,772 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8962264150943396 [2021-08-13 15:42:28,772 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1235 transitions. [2021-08-13 15:42:28,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1235 transitions. [2021-08-13 15:42:28,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:42:28,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1235 transitions. [2021-08-13 15:42:28,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.0) internal successors, (1235), 13 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:28,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 106.0) internal successors, (1484), 14 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:28,780 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 106.0) internal successors, (1484), 14 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:28,780 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 20 predicate places. [2021-08-13 15:42:28,781 INFO L482 AbstractCegarLoop]: Abstraction has has 131 places, 175 transitions, 675 flow [2021-08-13 15:42:28,781 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:28,781 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:42:28,781 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:42:28,781 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-13 15:42:28,782 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:42:28,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:42:28,784 INFO L82 PathProgramCache]: Analyzing trace with hash 745009837, now seen corresponding path program 1 times [2021-08-13 15:42:28,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:42:28,786 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072854079] [2021-08-13 15:42:28,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:42:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:42:28,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:28,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:42:28,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:28,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:42:28,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:28,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:42:28,947 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:42:28,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:42:28,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:28,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:42:28,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:28,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:42:28,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:28,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:42:28,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:42:28,990 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:42:28,990 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072854079] [2021-08-13 15:42:28,990 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072854079] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:42:28,991 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:42:28,991 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 15:42:28,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272108848] [2021-08-13 15:42:28,992 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 15:42:28,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:42:28,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 15:42:28,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-13 15:42:28,996 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 106 [2021-08-13 15:42:28,996 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 175 transitions, 675 flow. Second operand has 7 states, 7 states have (on average 91.57142857142857) internal successors, (641), 7 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:28,997 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:42:28,997 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 106 [2021-08-13 15:42:28,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:42:29,867 INFO L129 PetriNetUnfolder]: 900/3862 cut-off events. [2021-08-13 15:42:29,867 INFO L130 PetriNetUnfolder]: For 530/1740 co-relation queries the response was YES. [2021-08-13 15:42:29,888 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8076 conditions, 3862 events. 900/3862 cut-off events. For 530/1740 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 41785 event pairs, 189 based on Foata normal form. 46/3793 useless extension candidates. Maximal degree in co-relation 8018. Up to 578 conditions per place. [2021-08-13 15:42:29,896 INFO L132 encePairwiseOnDemand]: 97/106 looper letters, 18 selfloop transitions, 5 changer transitions 128/240 dead transitions. [2021-08-13 15:42:29,897 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 240 transitions, 1307 flow [2021-08-13 15:42:29,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 15:42:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 15:42:29,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1238 transitions. [2021-08-13 15:42:29,900 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8984034833091437 [2021-08-13 15:42:29,900 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1238 transitions. [2021-08-13 15:42:29,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1238 transitions. [2021-08-13 15:42:29,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:42:29,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1238 transitions. [2021-08-13 15:42:29,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.23076923076923) internal successors, (1238), 13 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:29,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 106.0) internal successors, (1484), 14 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:29,907 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 106.0) internal successors, (1484), 14 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:29,907 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 32 predicate places. [2021-08-13 15:42:29,907 INFO L482 AbstractCegarLoop]: Abstraction has has 143 places, 240 transitions, 1307 flow [2021-08-13 15:42:29,909 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 91.57142857142857) internal successors, (641), 7 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:29,909 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:42:29,909 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:42:29,909 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-13 15:42:29,909 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:42:29,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:42:29,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1658684793, now seen corresponding path program 2 times [2021-08-13 15:42:29,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:42:29,910 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595784779] [2021-08-13 15:42:29,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:42:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:42:30,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:30,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:42:30,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:30,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:42:30,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:30,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:42:30,028 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:42:30,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:42:30,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:30,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:42:30,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:30,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:42:30,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:30,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:42:30,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:42:30,070 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:42:30,071 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595784779] [2021-08-13 15:42:30,071 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595784779] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:42:30,071 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:42:30,071 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 15:42:30,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831283597] [2021-08-13 15:42:30,071 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 15:42:30,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:42:30,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 15:42:30,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-13 15:42:30,074 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 106 [2021-08-13 15:42:30,074 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 240 transitions, 1307 flow. Second operand has 7 states, 7 states have (on average 91.57142857142857) internal successors, (641), 7 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:30,074 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:42:30,074 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 106 [2021-08-13 15:42:30,075 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:42:31,168 INFO L129 PetriNetUnfolder]: 1278/6385 cut-off events. [2021-08-13 15:42:31,169 INFO L130 PetriNetUnfolder]: For 1762/6496 co-relation queries the response was YES. [2021-08-13 15:42:31,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14664 conditions, 6385 events. 1278/6385 cut-off events. For 1762/6496 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 80422 event pairs, 493 based on Foata normal form. 105/6285 useless extension candidates. Maximal degree in co-relation 14602. Up to 1208 conditions per place. [2021-08-13 15:42:31,212 INFO L132 encePairwiseOnDemand]: 99/106 looper letters, 21 selfloop transitions, 9 changer transitions 230/348 dead transitions. [2021-08-13 15:42:31,212 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 348 transitions, 2693 flow [2021-08-13 15:42:31,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-13 15:42:31,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-08-13 15:42:31,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1036 transitions. [2021-08-13 15:42:31,215 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.888507718696398 [2021-08-13 15:42:31,215 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1036 transitions. [2021-08-13 15:42:31,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1036 transitions. [2021-08-13 15:42:31,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:42:31,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1036 transitions. [2021-08-13 15:42:31,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.18181818181819) internal successors, (1036), 11 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:31,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 106.0) internal successors, (1272), 12 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:31,222 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 106.0) internal successors, (1272), 12 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:31,222 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 42 predicate places. [2021-08-13 15:42:31,222 INFO L482 AbstractCegarLoop]: Abstraction has has 153 places, 348 transitions, 2693 flow [2021-08-13 15:42:31,223 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 91.57142857142857) internal successors, (641), 7 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:31,223 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:42:31,223 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:42:31,223 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-13 15:42:31,223 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:42:31,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:42:31,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1076604412, now seen corresponding path program 1 times [2021-08-13 15:42:31,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:42:31,224 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795770592] [2021-08-13 15:42:31,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:42:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:42:31,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:31,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:42:31,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:31,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:42:31,303 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:42:31,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:42:31,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:31,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:42:31,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:31,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:42:31,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:31,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:42:31,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:42:31,343 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:42:31,343 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795770592] [2021-08-13 15:42:31,344 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795770592] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:42:31,344 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:42:31,344 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 15:42:31,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878594001] [2021-08-13 15:42:31,345 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 15:42:31,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:42:31,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 15:42:31,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 15:42:31,347 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 106 [2021-08-13 15:42:31,348 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 348 transitions, 2693 flow. Second operand has 6 states, 6 states have (on average 92.66666666666667) internal successors, (556), 6 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:31,348 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:42:31,348 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 106 [2021-08-13 15:42:31,348 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:42:32,640 INFO L129 PetriNetUnfolder]: 1576/8420 cut-off events. [2021-08-13 15:42:32,640 INFO L130 PetriNetUnfolder]: For 3153/13063 co-relation queries the response was YES. [2021-08-13 15:42:32,689 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20802 conditions, 8420 events. 1576/8420 cut-off events. For 3153/13063 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 115038 event pairs, 660 based on Foata normal form. 125/8274 useless extension candidates. Maximal degree in co-relation 20737. Up to 1731 conditions per place. [2021-08-13 15:42:32,699 INFO L132 encePairwiseOnDemand]: 100/106 looper letters, 16 selfloop transitions, 4 changer transitions 358/466 dead transitions. [2021-08-13 15:42:32,699 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 466 transitions, 4583 flow [2021-08-13 15:42:32,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 15:42:32,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 15:42:32,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 864 transitions. [2021-08-13 15:42:32,702 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9056603773584906 [2021-08-13 15:42:32,702 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 864 transitions. [2021-08-13 15:42:32,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 864 transitions. [2021-08-13 15:42:32,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:42:32,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 864 transitions. [2021-08-13 15:42:32,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.0) internal successors, (864), 9 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:32,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:32,707 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:32,707 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 50 predicate places. [2021-08-13 15:42:32,707 INFO L482 AbstractCegarLoop]: Abstraction has has 161 places, 466 transitions, 4583 flow [2021-08-13 15:42:32,708 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 92.66666666666667) internal successors, (556), 6 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:32,708 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:42:32,708 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:42:32,708 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-13 15:42:32,708 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:42:32,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:42:32,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1642182355, now seen corresponding path program 1 times [2021-08-13 15:42:32,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:42:32,709 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746184864] [2021-08-13 15:42:32,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:42:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:42:32,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:32,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:42:32,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:32,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:42:32,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:32,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:42:32,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:32,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 15:42:32,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:32,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 15:42:32,822 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-08-13 15:42:32,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-08-13 15:42:32,846 INFO L142 QuantifierPusher]: treesize reduction 26, result has 56.7 percent of original size [2021-08-13 15:42:32,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-08-13 15:42:32,869 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:42:32,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:42:32,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:32,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:42:32,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:32,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:42:32,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:32,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:42:32,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:42:32,907 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:42:32,908 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746184864] [2021-08-13 15:42:32,908 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746184864] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:42:32,908 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:42:32,908 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-13 15:42:32,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590877384] [2021-08-13 15:42:32,908 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-13 15:42:32,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:42:32,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-13 15:42:32,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-08-13 15:42:32,910 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 106 [2021-08-13 15:42:32,911 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 466 transitions, 4583 flow. Second operand has 11 states, 11 states have (on average 84.27272727272727) internal successors, (927), 11 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:32,911 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:42:32,911 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 106 [2021-08-13 15:42:32,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:42:37,189 INFO L129 PetriNetUnfolder]: 9492/28862 cut-off events. [2021-08-13 15:42:37,189 INFO L130 PetriNetUnfolder]: For 29711/38979 co-relation queries the response was YES. [2021-08-13 15:42:37,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84395 conditions, 28862 events. 9492/28862 cut-off events. For 29711/38979 co-relation queries the response was YES. Maximal size of possible extension queue 1875. Compared 386884 event pairs, 1537 based on Foata normal form. 125/28635 useless extension candidates. Maximal degree in co-relation 84322. Up to 6873 conditions per place. [2021-08-13 15:42:37,334 INFO L132 encePairwiseOnDemand]: 92/106 looper letters, 13 selfloop transitions, 10 changer transitions 879/981 dead transitions. [2021-08-13 15:42:37,337 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 981 transitions, 11939 flow [2021-08-13 15:42:37,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-13 15:42:37,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-08-13 15:42:37,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1570 transitions. [2021-08-13 15:42:37,344 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8228511530398323 [2021-08-13 15:42:37,344 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1570 transitions. [2021-08-13 15:42:37,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1570 transitions. [2021-08-13 15:42:37,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:42:37,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1570 transitions. [2021-08-13 15:42:37,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 87.22222222222223) internal successors, (1570), 18 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:37,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 106.0) internal successors, (2014), 19 states have internal predecessors, (2014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:37,353 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 106.0) internal successors, (2014), 19 states have internal predecessors, (2014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:37,353 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 67 predicate places. [2021-08-13 15:42:37,354 INFO L482 AbstractCegarLoop]: Abstraction has has 178 places, 981 transitions, 11939 flow [2021-08-13 15:42:37,354 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 84.27272727272727) internal successors, (927), 11 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:37,354 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:42:37,354 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:42:37,354 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-13 15:42:37,354 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:42:37,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:42:37,355 INFO L82 PathProgramCache]: Analyzing trace with hash 517634613, now seen corresponding path program 1 times [2021-08-13 15:42:37,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:42:37,355 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730795988] [2021-08-13 15:42:37,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:42:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:42:37,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:37,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:42:37,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:37,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:42:37,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:37,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:42:37,467 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-08-13 15:42:37,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-08-13 15:42:37,485 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-08-13 15:42:37,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-08-13 15:42:37,510 INFO L142 QuantifierPusher]: treesize reduction 26, result has 56.7 percent of original size [2021-08-13 15:42:37,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-08-13 15:42:37,535 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:42:37,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:42:37,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:37,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:42:37,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:37,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:42:37,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:37,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:42:37,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:42:37,573 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:42:37,574 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730795988] [2021-08-13 15:42:37,574 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730795988] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:42:37,574 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:42:37,574 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 15:42:37,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141721115] [2021-08-13 15:42:37,574 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 15:42:37,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:42:37,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 15:42:37,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-08-13 15:42:37,576 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 106 [2021-08-13 15:42:37,577 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 981 transitions, 11939 flow. Second operand has 10 states, 10 states have (on average 85.4) internal successors, (854), 10 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:37,577 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:42:37,577 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 106 [2021-08-13 15:42:37,577 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:42:44,141 INFO L129 PetriNetUnfolder]: 13733/40845 cut-off events. [2021-08-13 15:42:44,142 INFO L130 PetriNetUnfolder]: For 46617/60514 co-relation queries the response was YES. [2021-08-13 15:42:44,333 INFO L84 FinitePrefix]: Finished finitePrefix Result has 140816 conditions, 40845 events. 13733/40845 cut-off events. For 46617/60514 co-relation queries the response was YES. Maximal size of possible extension queue 2588. Compared 568203 event pairs, 1092 based on Foata normal form. 312/40901 useless extension candidates. Maximal degree in co-relation 140736. Up to 13065 conditions per place. [2021-08-13 15:42:44,373 INFO L132 encePairwiseOnDemand]: 95/106 looper letters, 22 selfloop transitions, 8 changer transitions 1613/1723 dead transitions. [2021-08-13 15:42:44,373 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 1723 transitions, 25123 flow [2021-08-13 15:42:44,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-13 15:42:44,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-08-13 15:42:44,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1073 transitions. [2021-08-13 15:42:44,377 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8435534591194969 [2021-08-13 15:42:44,377 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1073 transitions. [2021-08-13 15:42:44,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1073 transitions. [2021-08-13 15:42:44,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:42:44,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1073 transitions. [2021-08-13 15:42:44,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 89.41666666666667) internal successors, (1073), 12 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:44,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 106.0) internal successors, (1378), 13 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:44,383 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 106.0) internal successors, (1378), 13 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:44,384 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 78 predicate places. [2021-08-13 15:42:44,384 INFO L482 AbstractCegarLoop]: Abstraction has has 189 places, 1723 transitions, 25123 flow [2021-08-13 15:42:44,384 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 85.4) internal successors, (854), 10 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:44,384 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:42:44,384 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:42:44,384 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-13 15:42:44,385 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:42:44,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:42:44,385 INFO L82 PathProgramCache]: Analyzing trace with hash 307686296, now seen corresponding path program 1 times [2021-08-13 15:42:44,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:42:44,385 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940646296] [2021-08-13 15:42:44,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:42:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:42:44,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:44,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:42:44,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:44,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:42:44,616 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 15:42:44,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 15:42:44,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:44,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:42:44,640 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 15:42:44,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:42:44,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:44,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:42:44,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:42:44,649 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:42:44,649 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940646296] [2021-08-13 15:42:44,650 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940646296] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:42:44,650 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:42:44,650 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 15:42:44,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693506551] [2021-08-13 15:42:44,650 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 15:42:44,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:42:44,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 15:42:44,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 15:42:44,651 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-08-13 15:42:44,652 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 1723 transitions, 25123 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:44,652 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:42:44,652 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-08-13 15:42:44,652 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:42:50,492 INFO L129 PetriNetUnfolder]: 7509/24525 cut-off events. [2021-08-13 15:42:50,492 INFO L130 PetriNetUnfolder]: For 26038/29422 co-relation queries the response was YES. [2021-08-13 15:42:50,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 79004 conditions, 24525 events. 7509/24525 cut-off events. For 26038/29422 co-relation queries the response was YES. Maximal size of possible extension queue 1324. Compared 329265 event pairs, 1055 based on Foata normal form. 86/23706 useless extension candidates. Maximal degree in co-relation 78921. Up to 8806 conditions per place. [2021-08-13 15:42:50,614 INFO L132 encePairwiseOnDemand]: 96/106 looper letters, 24 selfloop transitions, 17 changer transitions 891/1079 dead transitions. [2021-08-13 15:42:50,614 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 1079 transitions, 14661 flow [2021-08-13 15:42:50,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 15:42:50,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 15:42:50,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 963 transitions. [2021-08-13 15:42:50,617 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9084905660377358 [2021-08-13 15:42:50,617 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 963 transitions. [2021-08-13 15:42:50,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 963 transitions. [2021-08-13 15:42:50,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:42:50,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 963 transitions. [2021-08-13 15:42:50,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.3) internal successors, (963), 10 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:50,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 106.0) internal successors, (1166), 11 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:50,621 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 106.0) internal successors, (1166), 11 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:50,622 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 87 predicate places. [2021-08-13 15:42:50,622 INFO L482 AbstractCegarLoop]: Abstraction has has 198 places, 1079 transitions, 14661 flow [2021-08-13 15:42:50,622 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:50,622 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:42:50,622 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:42:50,622 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-13 15:42:50,622 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:42:50,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:42:50,623 INFO L82 PathProgramCache]: Analyzing trace with hash -448220520, now seen corresponding path program 1 times [2021-08-13 15:42:50,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:42:50,623 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192398451] [2021-08-13 15:42:50,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:42:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:42:50,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:50,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:42:50,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:50,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:42:50,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:50,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:42:50,682 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 15:42:50,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 15:42:50,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:50,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:42:50,706 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 15:42:50,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:42:50,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:50,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:42:50,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:42:50,722 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:42:50,722 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192398451] [2021-08-13 15:42:50,722 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192398451] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:42:50,722 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:42:50,722 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 15:42:50,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671002427] [2021-08-13 15:42:50,723 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 15:42:50,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:42:50,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 15:42:50,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 15:42:50,724 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-08-13 15:42:50,724 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 1079 transitions, 14661 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:50,724 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:42:50,724 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-08-13 15:42:50,724 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:42:52,669 INFO L129 PetriNetUnfolder]: 2629/8670 cut-off events. [2021-08-13 15:42:52,669 INFO L130 PetriNetUnfolder]: For 4682/10611 co-relation queries the response was YES. [2021-08-13 15:42:52,695 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25497 conditions, 8670 events. 2629/8670 cut-off events. For 4682/10611 co-relation queries the response was YES. Maximal size of possible extension queue 986. Compared 101870 event pairs, 132 based on Foata normal form. 1025/9119 useless extension candidates. Maximal degree in co-relation 25411. Up to 1747 conditions per place. [2021-08-13 15:42:52,702 INFO L132 encePairwiseOnDemand]: 96/106 looper letters, 22 selfloop transitions, 44 changer transitions 356/526 dead transitions. [2021-08-13 15:42:52,702 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 526 transitions, 6159 flow [2021-08-13 15:42:52,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 15:42:52,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 15:42:52,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1253 transitions. [2021-08-13 15:42:52,705 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.909288824383164 [2021-08-13 15:42:52,705 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1253 transitions. [2021-08-13 15:42:52,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1253 transitions. [2021-08-13 15:42:52,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:42:52,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1253 transitions. [2021-08-13 15:42:52,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.38461538461539) internal successors, (1253), 13 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:52,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 106.0) internal successors, (1484), 14 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:52,712 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 106.0) internal successors, (1484), 14 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:52,712 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 84 predicate places. [2021-08-13 15:42:52,712 INFO L482 AbstractCegarLoop]: Abstraction has has 195 places, 526 transitions, 6159 flow [2021-08-13 15:42:52,712 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:52,712 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:42:52,712 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:42:52,712 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-13 15:42:52,713 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:42:52,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:42:52,713 INFO L82 PathProgramCache]: Analyzing trace with hash 346525275, now seen corresponding path program 1 times [2021-08-13 15:42:52,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:42:52,713 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672519626] [2021-08-13 15:42:52,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:42:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:42:52,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:52,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:42:52,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:52,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:42:52,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:52,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:42:52,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:52,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:42:52,786 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 15:42:52,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 15:42:52,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:52,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:42:52,809 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 15:42:52,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:42:52,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:42:52,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:42:52,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:42:52,819 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:42:52,819 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672519626] [2021-08-13 15:42:52,819 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672519626] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:42:52,819 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:42:52,819 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-13 15:42:52,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939569185] [2021-08-13 15:42:52,820 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 15:42:52,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:42:52,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 15:42:52,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-13 15:42:52,821 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-08-13 15:42:52,821 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 526 transitions, 6159 flow. Second operand has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:52,821 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:42:52,822 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-08-13 15:42:52,822 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:42:53,883 INFO L129 PetriNetUnfolder]: 2110/6290 cut-off events. [2021-08-13 15:42:53,883 INFO L130 PetriNetUnfolder]: For 2836/11509 co-relation queries the response was YES. [2021-08-13 15:42:53,918 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20423 conditions, 6290 events. 2110/6290 cut-off events. For 2836/11509 co-relation queries the response was YES. Maximal size of possible extension queue 988. Compared 74480 event pairs, 8 based on Foata normal form. 1173/6965 useless extension candidates. Maximal degree in co-relation 20334. Up to 1631 conditions per place. [2021-08-13 15:42:53,924 INFO L132 encePairwiseOnDemand]: 96/106 looper letters, 19 selfloop transitions, 48 changer transitions 113/268 dead transitions. [2021-08-13 15:42:53,925 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 268 transitions, 2243 flow [2021-08-13 15:42:53,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 15:42:53,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 15:42:53,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1528 transitions. [2021-08-13 15:42:53,927 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9009433962264151 [2021-08-13 15:42:53,927 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1528 transitions. [2021-08-13 15:42:53,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1528 transitions. [2021-08-13 15:42:53,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:42:53,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1528 transitions. [2021-08-13 15:42:53,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 95.5) internal successors, (1528), 16 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:53,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 106.0) internal successors, (1802), 17 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:53,934 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 106.0) internal successors, (1802), 17 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:53,934 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 78 predicate places. [2021-08-13 15:42:53,934 INFO L482 AbstractCegarLoop]: Abstraction has has 189 places, 268 transitions, 2243 flow [2021-08-13 15:42:53,935 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:42:53,935 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:42:53,935 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:42:53,935 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-13 15:42:53,935 INFO L430 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:42:53,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:42:53,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1736081176, now seen corresponding path program 1 times [2021-08-13 15:42:53,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:42:53,936 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729450824] [2021-08-13 15:42:53,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:42:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 15:42:53,993 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 15:42:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 15:42:54,050 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 15:42:54,093 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-13 15:42:54,093 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-13 15:42:54,093 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-13 15:42:54,097 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-13 15:42:54,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.08 03:42:54 BasicIcfg [2021-08-13 15:42:54,235 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-13 15:42:54,237 INFO L168 Benchmark]: Toolchain (without parser) took 30052.41 ms. Allocated memory was 176.2 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 139.7 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 8.0 GB. [2021-08-13 15:42:54,237 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 176.2 MB. Free memory is still 158.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-13 15:42:54,238 INFO L168 Benchmark]: CACSL2BoogieTranslator took 524.92 ms. Allocated memory is still 176.2 MB. Free memory was 139.5 MB in the beginning and 134.8 MB in the end (delta: 4.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-08-13 15:42:54,240 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.12 ms. Allocated memory is still 176.2 MB. Free memory was 134.8 MB in the beginning and 131.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-13 15:42:54,241 INFO L168 Benchmark]: Boogie Preprocessor took 30.71 ms. Allocated memory is still 176.2 MB. Free memory was 131.6 MB in the beginning and 129.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-13 15:42:54,241 INFO L168 Benchmark]: RCFGBuilder took 1950.02 ms. Allocated memory was 176.2 MB in the beginning and 211.8 MB in the end (delta: 35.7 MB). Free memory was 129.5 MB in the beginning and 116.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 75.6 MB. Max. memory is 8.0 GB. [2021-08-13 15:42:54,241 INFO L168 Benchmark]: TraceAbstraction took 27489.42 ms. Allocated memory was 211.8 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 115.8 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 8.0 GB. [2021-08-13 15:42:54,243 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.15 ms. Allocated memory is still 176.2 MB. Free memory is still 158.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 524.92 ms. Allocated memory is still 176.2 MB. Free memory was 139.5 MB in the beginning and 134.8 MB in the end (delta: 4.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 50.12 ms. Allocated memory is still 176.2 MB. Free memory was 134.8 MB in the beginning and 131.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 30.71 ms. Allocated memory is still 176.2 MB. Free memory was 131.6 MB in the beginning and 129.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1950.02 ms. Allocated memory was 176.2 MB in the beginning and 211.8 MB in the end (delta: 35.7 MB). Free memory was 129.5 MB in the beginning and 116.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 75.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 27489.42 ms. Allocated memory was 211.8 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 115.8 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L719] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L720] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L721] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L722] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L723] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L724] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L725] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L726] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L727] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L818] 0 pthread_t t1888; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L819] FCALL, FORK 0 pthread_create(&t1888, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] 0 pthread_t t1889; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L821] FCALL, FORK 0 pthread_create(&t1889, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L822] 0 pthread_t t1890; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L823] FCALL, FORK 0 pthread_create(&t1890, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 11.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 27221.3ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 24797.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 64.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 130 SDtfs, 489 SDslu, 450 SDs, 0 SdLazy, 743 SolverSat, 165 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 814.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1554.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=25123occurred in iteration=8, InterpolantAutomatonStates: 127, 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: 46.6ms SsaConstructionTime, 692.6ms SatisfiabilityAnalysisTime, 1308.9ms InterpolantComputationTime, 867 NumberOfCodeBlocks, 867 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 774 ConstructedInterpolants, 0 QuantifiedInterpolants, 2733 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...