/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.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 05:30:46,067 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-13 05:30:46,069 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-13 05:30:46,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-13 05:30:46,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-13 05:30:46,103 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-13 05:30:46,104 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-13 05:30:46,106 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-13 05:30:46,107 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-13 05:30:46,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-13 05:30:46,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-13 05:30:46,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-13 05:30:46,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-13 05:30:46,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-13 05:30:46,112 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-13 05:30:46,113 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-13 05:30:46,113 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-13 05:30:46,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-13 05:30:46,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-13 05:30:46,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-13 05:30:46,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-13 05:30:46,124 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-13 05:30:46,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-13 05:30:46,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-13 05:30:46,128 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-13 05:30:46,128 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-13 05:30:46,128 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-13 05:30:46,129 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-13 05:30:46,129 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-13 05:30:46,130 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-13 05:30:46,130 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-13 05:30:46,131 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-13 05:30:46,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-13 05:30:46,139 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-13 05:30:46,141 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-13 05:30:46,141 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-13 05:30:46,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-13 05:30:46,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-13 05:30:46,142 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-13 05:30:46,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-13 05:30:46,144 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-13 05:30:46,148 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.epf [2021-08-13 05:30:46,179 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-13 05:30:46,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-13 05:30:46,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-13 05:30:46,181 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-13 05:30:46,181 INFO L138 SettingsManager]: * Use SBE=true [2021-08-13 05:30:46,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-13 05:30:46,181 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-13 05:30:46,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-13 05:30:46,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-13 05:30:46,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-13 05:30:46,182 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-13 05:30:46,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-13 05:30:46,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-13 05:30:46,182 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-13 05:30:46,183 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-13 05:30:46,183 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-13 05:30:46,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-13 05:30:46,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-13 05:30:46,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-13 05:30:46,183 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-13 05:30:46,184 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-13 05:30:46,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 05:30:46,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-13 05:30:46,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-13 05:30:46,184 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-13 05:30:46,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-13 05:30:46,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-13 05:30:46,185 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-13 05:30:46,185 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-13 05:30:46,185 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-13 05:30:46,185 INFO L138 SettingsManager]: * Compute cosets for OwickiGries annotation iteratively=true [2021-08-13 05:30:46,185 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-13 05:30:46,186 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 05:30:46,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-13 05:30:46,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-13 05:30:46,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-13 05:30:46,515 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-13 05:30:46,515 INFO L275 PluginConnector]: CDTParser initialized [2021-08-13 05:30:46,516 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 05:30:46,571 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3668c372a/6aa3066ab3284757b95d39d8592da80e/FLAG14e5bc7bc [2021-08-13 05:30:47,060 INFO L306 CDTParser]: Found 1 translation units. [2021-08-13 05:30:47,060 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i [2021-08-13 05:30:47,079 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3668c372a/6aa3066ab3284757b95d39d8592da80e/FLAG14e5bc7bc [2021-08-13 05:30:47,361 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3668c372a/6aa3066ab3284757b95d39d8592da80e [2021-08-13 05:30:47,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-13 05:30:47,364 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-13 05:30:47,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-13 05:30:47,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-13 05:30:47,371 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-13 05:30:47,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 05:30:47" (1/1) ... [2021-08-13 05:30:47,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e2afd7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:30:47, skipping insertion in model container [2021-08-13 05:30:47,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 05:30:47" (1/1) ... [2021-08-13 05:30:47,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-13 05:30:47,424 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-13 05:30:47,564 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 05:30:47,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 05:30:47,849 INFO L203 MainTranslator]: Completed pre-run [2021-08-13 05:30:47,862 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 05:30:47,920 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 05:30:47,991 INFO L208 MainTranslator]: Completed translation [2021-08-13 05:30:47,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:30:47 WrapperNode [2021-08-13 05:30:47,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-13 05:30:47,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-13 05:30:47,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-13 05:30:47,994 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-13 05:30:47,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:30:47" (1/1) ... [2021-08-13 05:30:48,034 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:30:47" (1/1) ... [2021-08-13 05:30:48,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-13 05:30:48,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-13 05:30:48,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-13 05:30:48,075 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-13 05:30:48,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:30:47" (1/1) ... [2021-08-13 05:30:48,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:30:47" (1/1) ... [2021-08-13 05:30:48,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:30:47" (1/1) ... [2021-08-13 05:30:48,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:30:47" (1/1) ... [2021-08-13 05:30:48,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:30:47" (1/1) ... [2021-08-13 05:30:48,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:30:47" (1/1) ... [2021-08-13 05:30:48,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:30:47" (1/1) ... [2021-08-13 05:30:48,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-13 05:30:48,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-13 05:30:48,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-13 05:30:48,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-13 05:30:48,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:30:47" (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 05:30:48,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-13 05:30:48,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-13 05:30:48,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-13 05:30:48,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-13 05:30:48,197 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-13 05:30:48,198 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-13 05:30:48,198 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-13 05:30:48,198 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-13 05:30:48,198 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-13 05:30:48,198 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-13 05:30:48,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-13 05:30:48,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-13 05:30:48,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-13 05:30:48,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-13 05:30:48,200 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 05:30:49,798 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-13 05:30:49,798 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-13 05:30:49,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 05:30:49 BoogieIcfgContainer [2021-08-13 05:30:49,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-13 05:30:49,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-13 05:30:49,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-13 05:30:49,804 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-13 05:30:49,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.08 05:30:47" (1/3) ... [2021-08-13 05:30:49,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@407c9273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 05:30:49, skipping insertion in model container [2021-08-13 05:30:49,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:30:47" (2/3) ... [2021-08-13 05:30:49,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@407c9273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 05:30:49, skipping insertion in model container [2021-08-13 05:30:49,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 05:30:49" (3/3) ... [2021-08-13 05:30:49,806 INFO L111 eAbstractionObserver]: Analyzing ICFG safe004_rmo.opt.i [2021-08-13 05:30:49,811 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-13 05:30:49,812 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-13 05:30:49,812 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-13 05:30:49,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,841 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,841 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,841 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,841 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,845 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,845 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,845 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,845 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,846 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,846 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,846 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,846 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,850 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,850 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,850 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,850 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,855 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,855 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,857 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,857 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,858 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,860 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,860 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:30:49,862 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-13 05:30:49,881 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-13 05:30:49,898 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-13 05:30:49,899 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-13 05:30:49,899 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-13 05:30:49,899 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-13 05:30:49,899 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-13 05:30:49,899 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-13 05:30:49,899 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-13 05:30:49,899 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-13 05:30:49,908 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2021-08-13 05:30:49,942 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2021-08-13 05:30:49,943 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 05:30:49,946 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 05:30:49,946 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2021-08-13 05:30:49,950 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2021-08-13 05:30:49,961 INFO L129 PetriNetUnfolder]: 0/56 cut-off events. [2021-08-13 05:30:49,961 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 05:30:49,961 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:30:49,962 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 05:30:49,962 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 05:30:49,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:30:49,967 INFO L82 PathProgramCache]: Analyzing trace with hash -591144752, now seen corresponding path program 1 times [2021-08-13 05:30:49,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:30:49,974 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327099514] [2021-08-13 05:30:49,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:30:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:30:50,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:50,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:30:50,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:50,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:30:50,212 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 05:30:50,213 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:30:50,213 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327099514] [2021-08-13 05:30:50,214 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327099514] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:30:50,214 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:30:50,214 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-13 05:30:50,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628030755] [2021-08-13 05:30:50,222 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-13 05:30:50,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:30:50,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-13 05:30:50,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-13 05:30:50,239 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 106 [2021-08-13 05:30:50,244 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 05:30:50,244 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:30:50,244 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 106 [2021-08-13 05:30:50,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:30:50,383 INFO L129 PetriNetUnfolder]: 49/388 cut-off events. [2021-08-13 05:30:50,383 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 05:30:50,385 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 05:30:50,388 INFO L132 encePairwiseOnDemand]: 101/106 looper letters, 9 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2021-08-13 05:30:50,388 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 103 transitions, 237 flow [2021-08-13 05:30:50,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-13 05:30:50,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-13 05:30:50,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2021-08-13 05:30:50,399 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9465408805031447 [2021-08-13 05:30:50,400 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 301 transitions. [2021-08-13 05:30:50,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 301 transitions. [2021-08-13 05:30:50,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:30:50,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 301 transitions. [2021-08-13 05:30:50,409 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 05:30:50,415 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 05:30:50,415 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 05:30:50,416 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 0 predicate places. [2021-08-13 05:30:50,416 INFO L482 AbstractCegarLoop]: Abstraction has has 111 places, 103 transitions, 237 flow [2021-08-13 05:30:50,416 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 05:30:50,416 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:30:50,416 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 05:30:50,417 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-13 05:30:50,417 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 05:30:50,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:30:50,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1192679358, now seen corresponding path program 1 times [2021-08-13 05:30:50,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:30:50,418 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536261844] [2021-08-13 05:30:50,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:30:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:30:50,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:50,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:30:50,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:50,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:30:50,672 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 05:30:50,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 05:30:50,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:50,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:30:50,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:50,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:30:50,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:50,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:30:50,708 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 05:30:50,708 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:30:50,708 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536261844] [2021-08-13 05:30:50,709 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536261844] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:30:50,709 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:30:50,709 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 05:30:50,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109977367] [2021-08-13 05:30:50,712 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 05:30:50,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:30:50,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 05:30:50,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 05:30:50,715 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 106 [2021-08-13 05:30:50,716 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 05:30:50,716 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:30:50,716 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 106 [2021-08-13 05:30:50,716 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:30:50,915 INFO L129 PetriNetUnfolder]: 101/680 cut-off events. [2021-08-13 05:30:50,916 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-08-13 05:30:50,920 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 05:30:50,922 INFO L132 encePairwiseOnDemand]: 100/106 looper letters, 8 selfloop transitions, 2 changer transitions 13/116 dead transitions. [2021-08-13 05:30:50,922 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 116 transitions, 313 flow [2021-08-13 05:30:50,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 05:30:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 05:30:50,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 869 transitions. [2021-08-13 05:30:50,933 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.910901467505241 [2021-08-13 05:30:50,933 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 869 transitions. [2021-08-13 05:30:50,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 869 transitions. [2021-08-13 05:30:50,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:30:50,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 869 transitions. [2021-08-13 05:30:50,935 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 05:30:50,939 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 05:30:50,939 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 05:30:50,940 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 8 predicate places. [2021-08-13 05:30:50,940 INFO L482 AbstractCegarLoop]: Abstraction has has 119 places, 116 transitions, 313 flow [2021-08-13 05:30:50,947 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 05:30:50,947 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:30:50,948 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 05:30:50,948 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-13 05:30:50,948 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 05:30:50,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:30:50,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1133217032, now seen corresponding path program 1 times [2021-08-13 05:30:50,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:30:50,956 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663456834] [2021-08-13 05:30:50,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:30:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:30:51,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:51,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:30:51,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:51,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:30:51,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:51,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:30:51,064 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 05:30:51,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 05:30:51,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:51,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:30:51,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:51,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:30:51,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:51,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:30:51,100 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 05:30:51,100 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:30:51,128 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663456834] [2021-08-13 05:30:51,129 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663456834] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:30:51,129 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:30:51,129 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 05:30:51,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064566262] [2021-08-13 05:30:51,129 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 05:30:51,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:30:51,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 05:30:51,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-13 05:30:51,133 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 106 [2021-08-13 05:30:51,134 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 05:30:51,134 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:30:51,134 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 106 [2021-08-13 05:30:51,135 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:30:51,625 INFO L129 PetriNetUnfolder]: 589/2383 cut-off events. [2021-08-13 05:30:51,625 INFO L130 PetriNetUnfolder]: For 150/240 co-relation queries the response was YES. [2021-08-13 05:30:51,636 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 05:30:51,641 INFO L132 encePairwiseOnDemand]: 97/106 looper letters, 15 selfloop transitions, 5 changer transitions 66/175 dead transitions. [2021-08-13 05:30:51,641 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 175 transitions, 675 flow [2021-08-13 05:30:51,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 05:30:51,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 05:30:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1235 transitions. [2021-08-13 05:30:51,645 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8962264150943396 [2021-08-13 05:30:51,645 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1235 transitions. [2021-08-13 05:30:51,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1235 transitions. [2021-08-13 05:30:51,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:30:51,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1235 transitions. [2021-08-13 05:30:51,649 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 05:30:51,652 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 05:30:51,653 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 05:30:51,654 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 20 predicate places. [2021-08-13 05:30:51,654 INFO L482 AbstractCegarLoop]: Abstraction has has 131 places, 175 transitions, 675 flow [2021-08-13 05:30:51,654 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 05:30:51,654 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:30:51,654 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 05:30:51,654 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-13 05:30:51,655 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 05:30:51,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:30:51,655 INFO L82 PathProgramCache]: Analyzing trace with hash 745009837, now seen corresponding path program 1 times [2021-08-13 05:30:51,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:30:51,655 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970056757] [2021-08-13 05:30:51,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:30:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:30:51,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:51,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:30:51,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:51,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:30:51,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:51,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:30:51,804 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 05:30:51,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 05:30:51,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:51,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:30:51,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:51,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:30:51,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:51,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:30:51,845 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 05:30:51,845 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:30:51,845 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970056757] [2021-08-13 05:30:51,846 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970056757] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:30:51,846 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:30:51,846 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 05:30:51,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423775146] [2021-08-13 05:30:51,848 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 05:30:51,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:30:51,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 05:30:51,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-13 05:30:51,851 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 106 [2021-08-13 05:30:51,852 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 05:30:51,852 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:30:51,852 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 106 [2021-08-13 05:30:51,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:30:52,651 INFO L129 PetriNetUnfolder]: 810/3705 cut-off events. [2021-08-13 05:30:52,652 INFO L130 PetriNetUnfolder]: For 638/1822 co-relation queries the response was YES. [2021-08-13 05:30:52,671 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7430 conditions, 3705 events. 810/3705 cut-off events. For 638/1822 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 40734 event pairs, 307 based on Foata normal form. 51/3605 useless extension candidates. Maximal degree in co-relation 7372. Up to 758 conditions per place. [2021-08-13 05:30:52,677 INFO L132 encePairwiseOnDemand]: 99/106 looper letters, 21 selfloop transitions, 6 changer transitions 113/228 dead transitions. [2021-08-13 05:30:52,678 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 228 transitions, 1267 flow [2021-08-13 05:30:52,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-13 05:30:52,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-08-13 05:30:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1036 transitions. [2021-08-13 05:30:52,680 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.888507718696398 [2021-08-13 05:30:52,680 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1036 transitions. [2021-08-13 05:30:52,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1036 transitions. [2021-08-13 05:30:52,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:30:52,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1036 transitions. [2021-08-13 05:30:52,683 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 05:30:52,685 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 05:30:52,685 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 05:30:52,685 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 30 predicate places. [2021-08-13 05:30:52,685 INFO L482 AbstractCegarLoop]: Abstraction has has 141 places, 228 transitions, 1267 flow [2021-08-13 05:30:52,686 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 05:30:52,686 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:30:52,686 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 05:30:52,686 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-13 05:30:52,686 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 05:30:52,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:30:52,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2076344812, now seen corresponding path program 1 times [2021-08-13 05:30:52,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:30:52,687 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500646372] [2021-08-13 05:30:52,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:30:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:30:52,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:52,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:30:52,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:52,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:30:52,755 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 05:30:52,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 05:30:52,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:52,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:30:52,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:52,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:30:52,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:52,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:30:52,825 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 05:30:52,826 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:30:52,826 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500646372] [2021-08-13 05:30:52,826 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500646372] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:30:52,826 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:30:52,826 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 05:30:52,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262612772] [2021-08-13 05:30:52,827 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 05:30:52,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:30:52,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 05:30:52,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 05:30:52,829 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 106 [2021-08-13 05:30:52,831 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 228 transitions, 1267 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 05:30:52,831 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:30:52,831 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 106 [2021-08-13 05:30:52,832 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:30:53,716 INFO L129 PetriNetUnfolder]: 946/4749 cut-off events. [2021-08-13 05:30:53,719 INFO L130 PetriNetUnfolder]: For 1294/4176 co-relation queries the response was YES. [2021-08-13 05:30:53,747 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10586 conditions, 4749 events. 946/4749 cut-off events. For 1294/4176 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 57085 event pairs, 376 based on Foata normal form. 70/4642 useless extension candidates. Maximal degree in co-relation 10525. Up to 985 conditions per place. [2021-08-13 05:30:53,754 INFO L132 encePairwiseOnDemand]: 100/106 looper letters, 15 selfloop transitions, 3 changer transitions 178/284 dead transitions. [2021-08-13 05:30:53,754 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 284 transitions, 2073 flow [2021-08-13 05:30:53,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 05:30:53,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 05:30:53,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 864 transitions. [2021-08-13 05:30:53,757 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9056603773584906 [2021-08-13 05:30:53,757 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 864 transitions. [2021-08-13 05:30:53,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 864 transitions. [2021-08-13 05:30:53,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:30:53,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 864 transitions. [2021-08-13 05:30:53,759 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 05:30:53,761 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 05:30:53,761 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 05:30:53,761 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 38 predicate places. [2021-08-13 05:30:53,762 INFO L482 AbstractCegarLoop]: Abstraction has has 149 places, 284 transitions, 2073 flow [2021-08-13 05:30:53,762 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 05:30:53,762 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:30:53,762 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 05:30:53,763 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-13 05:30:53,763 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 05:30:53,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:30:53,763 INFO L82 PathProgramCache]: Analyzing trace with hash 636745613, now seen corresponding path program 1 times [2021-08-13 05:30:53,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:30:53,764 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834061690] [2021-08-13 05:30:53,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:30:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:30:53,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:53,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:30:53,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:53,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:30:53,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:53,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:30:53,878 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 05:30:53,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 05:30:53,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:53,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:30:53,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:53,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:30:53,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:53,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:30:53,919 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 05:30:53,919 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:30:53,919 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834061690] [2021-08-13 05:30:53,919 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834061690] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:30:53,919 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:30:53,919 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 05:30:53,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307069741] [2021-08-13 05:30:53,921 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 05:30:53,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:30:53,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 05:30:53,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-13 05:30:53,922 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 106 [2021-08-13 05:30:53,923 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 284 transitions, 2073 flow. Second operand has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 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 05:30:53,923 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:30:53,923 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 106 [2021-08-13 05:30:53,923 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:30:55,558 INFO L129 PetriNetUnfolder]: 1566/8358 cut-off events. [2021-08-13 05:30:55,558 INFO L130 PetriNetUnfolder]: For 3280/12893 co-relation queries the response was YES. [2021-08-13 05:30:55,602 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20718 conditions, 8358 events. 1566/8358 cut-off events. For 3280/12893 co-relation queries the response was YES. Maximal size of possible extension queue 746. Compared 113939 event pairs, 652 based on Foata normal form. 85/8176 useless extension candidates. Maximal degree in co-relation 20653. Up to 1703 conditions per place. [2021-08-13 05:30:55,619 INFO L132 encePairwiseOnDemand]: 97/106 looper letters, 15 selfloop transitions, 6 changer transitions 358/466 dead transitions. [2021-08-13 05:30:55,619 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 466 transitions, 4583 flow [2021-08-13 05:30:55,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 05:30:55,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 05:30:55,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1238 transitions. [2021-08-13 05:30:55,624 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8984034833091437 [2021-08-13 05:30:55,624 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1238 transitions. [2021-08-13 05:30:55,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1238 transitions. [2021-08-13 05:30:55,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:30:55,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1238 transitions. [2021-08-13 05:30:55,628 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 05:30:55,631 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 05:30:55,632 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 05:30:55,632 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 50 predicate places. [2021-08-13 05:30:55,632 INFO L482 AbstractCegarLoop]: Abstraction has has 161 places, 466 transitions, 4583 flow [2021-08-13 05:30:55,633 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 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 05:30:55,633 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:30:55,633 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 05:30:55,633 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-13 05:30:55,633 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 05:30:55,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:30:55,634 INFO L82 PathProgramCache]: Analyzing trace with hash 839586541, now seen corresponding path program 2 times [2021-08-13 05:30:55,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:30:55,634 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355901962] [2021-08-13 05:30:55,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:30:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:30:55,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:55,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:30:55,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:55,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:30:55,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:55,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 05:30:55,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:55,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 05:30:55,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:55,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 05:30:55,794 INFO L142 QuantifierPusher]: treesize reduction 26, result has 56.7 percent of original size [2021-08-13 05:30:55,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-08-13 05:30:55,819 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 05:30:55,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 05:30:55,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:55,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:30:55,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:55,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:30:55,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:30:55,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:30:55,858 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 05:30:55,860 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:30:55,860 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355901962] [2021-08-13 05:30:55,860 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355901962] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:30:55,861 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:30:55,861 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 05:30:55,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167735908] [2021-08-13 05:30:55,861 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 05:30:55,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:30:55,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 05:30:55,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-13 05:30:55,863 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 106 [2021-08-13 05:30:55,864 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 466 transitions, 4583 flow. Second operand has 10 states, 10 states have (on average 85.3) internal successors, (853), 10 states have internal predecessors, (853), 0 states have call successors, (0), 0 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 05:30:55,864 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:30:55,864 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 106 [2021-08-13 05:30:55,865 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:31:00,135 INFO L129 PetriNetUnfolder]: 9431/28561 cut-off events. [2021-08-13 05:31:00,136 INFO L130 PetriNetUnfolder]: For 28974/38205 co-relation queries the response was YES. [2021-08-13 05:31:00,295 INFO L84 FinitePrefix]: Finished finitePrefix Result has 83891 conditions, 28561 events. 9431/28561 cut-off events. For 28974/38205 co-relation queries the response was YES. Maximal size of possible extension queue 1844. Compared 381242 event pairs, 1516 based on Foata normal form. 121/28364 useless extension candidates. Maximal degree in co-relation 83819. Up to 6838 conditions per place. [2021-08-13 05:31:00,321 INFO L132 encePairwiseOnDemand]: 93/106 looper letters, 13 selfloop transitions, 9 changer transitions 879/981 dead transitions. [2021-08-13 05:31:00,322 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 981 transitions, 11937 flow [2021-08-13 05:31:00,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-13 05:31:00,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-08-13 05:31:00,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1503 transitions. [2021-08-13 05:31:00,325 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8340732519422863 [2021-08-13 05:31:00,325 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1503 transitions. [2021-08-13 05:31:00,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1503 transitions. [2021-08-13 05:31:00,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:31:00,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1503 transitions. [2021-08-13 05:31:00,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 88.41176470588235) internal successors, (1503), 17 states have internal predecessors, (1503), 0 states have call successors, (0), 0 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 05:31:00,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 106.0) internal successors, (1908), 18 states have internal predecessors, (1908), 0 states have call successors, (0), 0 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 05:31:00,333 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 106.0) internal successors, (1908), 18 states have internal predecessors, (1908), 0 states have call successors, (0), 0 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 05:31:00,333 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 66 predicate places. [2021-08-13 05:31:00,333 INFO L482 AbstractCegarLoop]: Abstraction has has 177 places, 981 transitions, 11937 flow [2021-08-13 05:31:00,334 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 85.3) internal successors, (853), 10 states have internal predecessors, (853), 0 states have call successors, (0), 0 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 05:31:00,334 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:31:00,334 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 05:31:00,334 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-13 05:31:00,334 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 05:31:00,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:31:00,335 INFO L82 PathProgramCache]: Analyzing trace with hash 517634613, now seen corresponding path program 1 times [2021-08-13 05:31:00,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:31:00,335 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031609439] [2021-08-13 05:31:00,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:31:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:31:00,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:31:00,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:31:00,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:31:00,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:31:00,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:31:00,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 05:31:00,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:31:00,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 05:31:00,467 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.8 percent of original size [2021-08-13 05:31:00,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-08-13 05:31:00,493 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.6 percent of original size [2021-08-13 05:31:00,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-08-13 05:31:00,522 INFO L142 QuantifierPusher]: treesize reduction 21, result has 75.3 percent of original size [2021-08-13 05:31:00,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-08-13 05:31:00,558 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 05:31:00,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 05:31:00,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:31:00,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:31:00,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:31:00,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:31:00,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:31:00,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:31:00,597 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 05:31:00,597 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:31:00,597 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031609439] [2021-08-13 05:31:00,597 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031609439] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:31:00,597 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:31:00,597 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-13 05:31:00,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650697160] [2021-08-13 05:31:00,598 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-13 05:31:00,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:31:00,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-13 05:31:00,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-08-13 05:31:00,601 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 106 [2021-08-13 05:31:00,602 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 981 transitions, 11937 flow. Second operand has 11 states, 11 states have (on average 84.36363636363636) internal successors, (928), 11 states have internal predecessors, (928), 0 states have call successors, (0), 0 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 05:31:00,602 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:31:00,602 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 106 [2021-08-13 05:31:00,602 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:31:07,103 INFO L129 PetriNetUnfolder]: 13734/40646 cut-off events. [2021-08-13 05:31:07,103 INFO L130 PetriNetUnfolder]: For 44843/53701 co-relation queries the response was YES. [2021-08-13 05:31:07,274 INFO L84 FinitePrefix]: Finished finitePrefix Result has 140661 conditions, 40646 events. 13734/40646 cut-off events. For 44843/53701 co-relation queries the response was YES. Maximal size of possible extension queue 2542. Compared 563114 event pairs, 1116 based on Foata normal form. 287/40724 useless extension candidates. Maximal degree in co-relation 140581. Up to 13042 conditions per place. [2021-08-13 05:31:07,310 INFO L132 encePairwiseOnDemand]: 94/106 looper letters, 22 selfloop transitions, 9 changer transitions 1607/1723 dead transitions. [2021-08-13 05:31:07,310 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 1723 transitions, 25123 flow [2021-08-13 05:31:07,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 05:31:07,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 05:31:07,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1145 transitions. [2021-08-13 05:31:07,316 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8309143686502177 [2021-08-13 05:31:07,316 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1145 transitions. [2021-08-13 05:31:07,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1145 transitions. [2021-08-13 05:31:07,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:31:07,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1145 transitions. [2021-08-13 05:31:07,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 88.07692307692308) internal successors, (1145), 13 states have internal predecessors, (1145), 0 states have call successors, (0), 0 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 05:31:07,321 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 05:31:07,321 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 05:31:07,322 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 78 predicate places. [2021-08-13 05:31:07,322 INFO L482 AbstractCegarLoop]: Abstraction has has 189 places, 1723 transitions, 25123 flow [2021-08-13 05:31:07,322 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 84.36363636363636) internal successors, (928), 11 states have internal predecessors, (928), 0 states have call successors, (0), 0 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 05:31:07,322 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:31:07,322 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 05:31:07,323 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-13 05:31:07,323 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 05:31:07,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:31:07,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1824097636, now seen corresponding path program 1 times [2021-08-13 05:31:07,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:31:07,323 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348147437] [2021-08-13 05:31:07,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:31:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:31:07,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:31:07,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:31:07,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:31:07,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:31:07,389 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 05:31:07,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 05:31:07,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:31:07,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 05:31:07,414 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 05:31:07,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:31:07,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:31:07,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:31:07,423 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 05:31:07,423 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:31:07,424 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348147437] [2021-08-13 05:31:07,424 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348147437] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:31:07,426 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:31:07,426 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 05:31:07,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961774737] [2021-08-13 05:31:07,427 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 05:31:07,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:31:07,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 05:31:07,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 05:31:07,428 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-08-13 05:31:07,428 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 05:31:07,429 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:31:07,429 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-08-13 05:31:07,429 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:31:12,735 INFO L129 PetriNetUnfolder]: 7512/24500 cut-off events. [2021-08-13 05:31:12,735 INFO L130 PetriNetUnfolder]: For 25627/28929 co-relation queries the response was YES. [2021-08-13 05:31:12,830 INFO L84 FinitePrefix]: Finished finitePrefix Result has 78924 conditions, 24500 events. 7512/24500 cut-off events. For 25627/28929 co-relation queries the response was YES. Maximal size of possible extension queue 1317. Compared 328542 event pairs, 1067 based on Foata normal form. 86/23692 useless extension candidates. Maximal degree in co-relation 78841. Up to 8797 conditions per place. [2021-08-13 05:31:12,857 INFO L132 encePairwiseOnDemand]: 96/106 looper letters, 24 selfloop transitions, 17 changer transitions 891/1079 dead transitions. [2021-08-13 05:31:12,857 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 1079 transitions, 14661 flow [2021-08-13 05:31:12,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 05:31:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 05:31:12,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 963 transitions. [2021-08-13 05:31:12,860 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9084905660377358 [2021-08-13 05:31:12,860 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 963 transitions. [2021-08-13 05:31:12,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 963 transitions. [2021-08-13 05:31:12,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:31:12,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 963 transitions. [2021-08-13 05:31:12,862 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 05:31:12,864 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 05:31:12,864 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 05:31:12,864 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 87 predicate places. [2021-08-13 05:31:12,864 INFO L482 AbstractCegarLoop]: Abstraction has has 198 places, 1079 transitions, 14661 flow [2021-08-13 05:31:12,865 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 05:31:12,865 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:31:12,865 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 05:31:12,865 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-13 05:31:12,865 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 05:31:12,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:31:12,865 INFO L82 PathProgramCache]: Analyzing trace with hash -448220520, now seen corresponding path program 1 times [2021-08-13 05:31:12,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:31:12,865 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537242501] [2021-08-13 05:31:12,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:31:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:31:12,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:31:12,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:31:12,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:31:12,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:31:12,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:31:12,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:31:12,922 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 05:31:12,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 05:31:12,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:31:12,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 05:31:12,944 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 05:31:12,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:31:12,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:31:12,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:31:12,955 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 05:31:12,955 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:31:12,955 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537242501] [2021-08-13 05:31:12,955 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537242501] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:31:12,955 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:31:12,955 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 05:31:12,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478419499] [2021-08-13 05:31:12,956 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 05:31:12,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:31:12,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 05:31:12,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 05:31:12,957 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-08-13 05:31:12,958 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 05:31:12,958 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:31:12,958 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-08-13 05:31:12,958 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:31:14,958 INFO L129 PetriNetUnfolder]: 2629/8664 cut-off events. [2021-08-13 05:31:14,959 INFO L130 PetriNetUnfolder]: For 4642/10548 co-relation queries the response was YES. [2021-08-13 05:31:14,989 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25487 conditions, 8664 events. 2629/8664 cut-off events. For 4642/10548 co-relation queries the response was YES. Maximal size of possible extension queue 986. Compared 101903 event pairs, 132 based on Foata normal form. 1022/9110 useless extension candidates. Maximal degree in co-relation 25401. Up to 1745 conditions per place. [2021-08-13 05:31:14,997 INFO L132 encePairwiseOnDemand]: 96/106 looper letters, 22 selfloop transitions, 44 changer transitions 356/526 dead transitions. [2021-08-13 05:31:14,998 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 526 transitions, 6159 flow [2021-08-13 05:31:14,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 05:31:14,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 05:31:15,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1253 transitions. [2021-08-13 05:31:15,001 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.909288824383164 [2021-08-13 05:31:15,001 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1253 transitions. [2021-08-13 05:31:15,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1253 transitions. [2021-08-13 05:31:15,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:31:15,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1253 transitions. [2021-08-13 05:31:15,004 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 05:31:15,006 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 05:31:15,006 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 05:31:15,007 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 84 predicate places. [2021-08-13 05:31:15,007 INFO L482 AbstractCegarLoop]: Abstraction has has 195 places, 526 transitions, 6159 flow [2021-08-13 05:31:15,007 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 05:31:15,007 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:31:15,007 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 05:31:15,007 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-13 05:31:15,007 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 05:31:15,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:31:15,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1574674187, now seen corresponding path program 1 times [2021-08-13 05:31:15,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:31:15,008 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495118706] [2021-08-13 05:31:15,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:31:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:31:15,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:31:15,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:31:15,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:31:15,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:31:15,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:31:15,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:31:15,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:31:15,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:31:15,079 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 05:31:15,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 05:31:15,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:31:15,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 05:31:15,104 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 05:31:15,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:31:15,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:31:15,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:31:15,114 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 05:31:15,114 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:31:15,114 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495118706] [2021-08-13 05:31:15,114 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495118706] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:31:15,114 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:31:15,114 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-13 05:31:15,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179196574] [2021-08-13 05:31:15,114 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 05:31:15,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:31:15,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 05:31:15,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-13 05:31:15,116 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-08-13 05:31:15,116 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 05:31:15,116 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:31:15,117 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-08-13 05:31:15,117 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:31:16,267 INFO L129 PetriNetUnfolder]: 2110/6222 cut-off events. [2021-08-13 05:31:16,267 INFO L130 PetriNetUnfolder]: For 2832/11498 co-relation queries the response was YES. [2021-08-13 05:31:16,292 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20355 conditions, 6222 events. 2110/6222 cut-off events. For 2832/11498 co-relation queries the response was YES. Maximal size of possible extension queue 986. Compared 73259 event pairs, 8 based on Foata normal form. 1170/6894 useless extension candidates. Maximal degree in co-relation 20266. Up to 1631 conditions per place. [2021-08-13 05:31:16,298 INFO L132 encePairwiseOnDemand]: 96/106 looper letters, 19 selfloop transitions, 48 changer transitions 113/268 dead transitions. [2021-08-13 05:31:16,298 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 268 transitions, 2243 flow [2021-08-13 05:31:16,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 05:31:16,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 05:31:16,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1528 transitions. [2021-08-13 05:31:16,301 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9009433962264151 [2021-08-13 05:31:16,301 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1528 transitions. [2021-08-13 05:31:16,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1528 transitions. [2021-08-13 05:31:16,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:31:16,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1528 transitions. [2021-08-13 05:31:16,304 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 05:31:16,306 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 05:31:16,307 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 05:31:16,307 INFO L348 CegarLoopForPetriNet]: 111 programPoint places, 78 predicate places. [2021-08-13 05:31:16,307 INFO L482 AbstractCegarLoop]: Abstraction has has 189 places, 268 transitions, 2243 flow [2021-08-13 05:31:16,307 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 05:31:16,307 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:31:16,307 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 05:31:16,308 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-13 05:31:16,308 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 05:31:16,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:31:16,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1966271342, now seen corresponding path program 1 times [2021-08-13 05:31:16,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:31:16,308 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141722713] [2021-08-13 05:31:16,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:31:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 05:31:16,353 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 05:31:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 05:31:16,390 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 05:31:16,423 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-13 05:31:16,423 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-13 05:31:16,423 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-13 05:31:16,426 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-13 05:31:16,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.08 05:31:16 BasicIcfg [2021-08-13 05:31:16,545 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-13 05:31:16,546 INFO L168 Benchmark]: Toolchain (without parser) took 29182.39 ms. Allocated memory was 189.8 MB in the beginning and 4.7 GB in the end (delta: 4.5 GB). Free memory was 153.7 MB in the beginning and 3.3 GB in the end (delta: -3.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 8.0 GB. [2021-08-13 05:31:16,546 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 189.8 MB. Free memory is still 172.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-13 05:31:16,546 INFO L168 Benchmark]: CACSL2BoogieTranslator took 627.94 ms. Allocated memory is still 189.8 MB. Free memory was 153.5 MB in the beginning and 147.9 MB in the end (delta: 5.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-08-13 05:31:16,547 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.29 ms. Allocated memory is still 189.8 MB. Free memory was 147.9 MB in the beginning and 145.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-13 05:31:16,547 INFO L168 Benchmark]: Boogie Preprocessor took 51.56 ms. Allocated memory is still 189.8 MB. Free memory was 145.5 MB in the beginning and 142.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-13 05:31:16,547 INFO L168 Benchmark]: RCFGBuilder took 1673.46 ms. Allocated memory was 189.8 MB in the beginning and 237.0 MB in the end (delta: 47.2 MB). Free memory was 142.9 MB in the beginning and 135.8 MB in the end (delta: 7.0 MB). Peak memory consumption was 82.5 MB. Max. memory is 8.0 GB. [2021-08-13 05:31:16,547 INFO L168 Benchmark]: TraceAbstraction took 26744.09 ms. Allocated memory was 237.0 MB in the beginning and 4.7 GB in the end (delta: 4.4 GB). Free memory was 135.3 MB in the beginning and 3.3 GB in the end (delta: -3.2 GB). Peak memory consumption was 1.2 GB. Max. memory is 8.0 GB. [2021-08-13 05:31:16,548 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.13 ms. Allocated memory is still 189.8 MB. Free memory is still 172.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 627.94 ms. Allocated memory is still 189.8 MB. Free memory was 153.5 MB in the beginning and 147.9 MB in the end (delta: 5.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 80.29 ms. Allocated memory is still 189.8 MB. Free memory was 147.9 MB in the beginning and 145.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 51.56 ms. Allocated memory is still 189.8 MB. Free memory was 145.5 MB in the beginning and 142.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1673.46 ms. Allocated memory was 189.8 MB in the beginning and 237.0 MB in the end (delta: 47.2 MB). Free memory was 142.9 MB in the beginning and 135.8 MB in the end (delta: 7.0 MB). Peak memory consumption was 82.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 26744.09 ms. Allocated memory was 237.0 MB in the beginning and 4.7 GB in the end (delta: 4.4 GB). Free memory was 135.3 MB in the beginning and 3.3 GB in the end (delta: -3.2 GB). Peak memory consumption was 1.2 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}, 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}, 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}, 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 [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] [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 [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: 10.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 26528.6ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 24287.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 51.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 130 SDtfs, 489 SDslu, 447 SDs, 0 SdLazy, 747 SolverSat, 163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 743.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1517.0ms 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.1ms SsaConstructionTime, 472.7ms SatisfiabilityAnalysisTime, 1312.9ms InterpolantComputationTime, 870 NumberOfCodeBlocks, 870 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 777 ConstructedInterpolants, 0 QuantifiedInterpolants, 2838 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...