/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix032_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 20:07:34,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 20:07:34,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 20:07:34,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 20:07:34,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 20:07:34,126 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 20:07:34,127 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 20:07:34,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 20:07:34,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 20:07:34,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 20:07:34,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 20:07:34,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 20:07:34,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 20:07:34,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 20:07:34,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 20:07:34,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 20:07:34,135 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 20:07:34,136 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 20:07:34,137 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 20:07:34,138 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 20:07:34,139 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 20:07:34,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 20:07:34,141 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 20:07:34,142 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 20:07:34,144 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 20:07:34,144 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 20:07:34,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 20:07:34,145 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 20:07:34,145 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 20:07:34,146 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 20:07:34,146 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 20:07:34,147 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 20:07:34,147 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 20:07:34,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 20:07:34,148 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 20:07:34,149 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 20:07:34,149 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 20:07:34,149 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 20:07:34,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 20:07:34,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 20:07:34,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 20:07:34,151 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2021-03-11 20:07:34,166 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 20:07:34,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 20:07:34,167 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 20:07:34,167 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 20:07:34,167 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 20:07:34,168 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 20:07:34,168 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 20:07:34,168 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 20:07:34,168 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 20:07:34,168 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 20:07:34,168 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 20:07:34,168 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 20:07:34,168 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 20:07:34,168 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 20:07:34,169 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 20:07:34,169 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 20:07:34,169 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 20:07:34,169 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 20:07:34,169 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 20:07:34,169 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 20:07:34,169 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 20:07:34,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:07:34,170 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 20:07:34,170 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 20:07:34,170 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 20:07:34,170 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 20:07:34,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 20:07:34,170 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 20:07:34,170 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-11 20:07:34,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 20:07:34,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 20:07:34,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 20:07:34,434 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 20:07:34,434 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 20:07:34,435 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_pso.oepc.i [2021-03-11 20:07:34,475 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa7b04ed8/07c6b21f28494d7a9be4e5b232f6a825/FLAGe0053e7d4 [2021-03-11 20:07:34,948 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 20:07:34,949 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_pso.oepc.i [2021-03-11 20:07:34,957 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa7b04ed8/07c6b21f28494d7a9be4e5b232f6a825/FLAGe0053e7d4 [2021-03-11 20:07:35,228 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa7b04ed8/07c6b21f28494d7a9be4e5b232f6a825 [2021-03-11 20:07:35,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 20:07:35,233 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 20:07:35,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 20:07:35,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 20:07:35,239 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 20:07:35,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:07:35" (1/1) ... [2021-03-11 20:07:35,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c1d417d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:07:35, skipping insertion in model container [2021-03-11 20:07:35,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:07:35" (1/1) ... [2021-03-11 20:07:35,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 20:07:35,287 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 20:07:35,378 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_pso.oepc.i[949,962] [2021-03-11 20:07:35,515 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:07:35,520 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 20:07:35,529 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_pso.oepc.i[949,962] [2021-03-11 20:07:35,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:07:35,632 INFO L208 MainTranslator]: Completed translation [2021-03-11 20:07:35,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:07:35 WrapperNode [2021-03-11 20:07:35,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 20:07:35,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 20:07:35,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 20:07:35,636 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 20:07:35,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:07:35" (1/1) ... [2021-03-11 20:07:35,666 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:07:35" (1/1) ... [2021-03-11 20:07:35,682 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 20:07:35,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 20:07:35,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 20:07:35,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 20:07:35,688 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:07:35" (1/1) ... [2021-03-11 20:07:35,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:07:35" (1/1) ... [2021-03-11 20:07:35,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:07:35" (1/1) ... [2021-03-11 20:07:35,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:07:35" (1/1) ... [2021-03-11 20:07:35,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:07:35" (1/1) ... [2021-03-11 20:07:35,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:07:35" (1/1) ... [2021-03-11 20:07:35,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:07:35" (1/1) ... [2021-03-11 20:07:35,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 20:07:35,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 20:07:35,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 20:07:35,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 20:07:35,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:07:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:07:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 20:07:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 20:07:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 20:07:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 20:07:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 20:07:35,768 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 20:07:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 20:07:35,769 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 20:07:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 20:07:35,769 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 20:07:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 20:07:35,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 20:07:35,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 20:07:35,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 20:07:35,772 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 20:07:37,158 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 20:07:37,158 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 20:07:37,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:07:37 BoogieIcfgContainer [2021-03-11 20:07:37,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 20:07:37,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 20:07:37,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 20:07:37,163 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 20:07:37,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:07:35" (1/3) ... [2021-03-11 20:07:37,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1060ab39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:07:37, skipping insertion in model container [2021-03-11 20:07:37,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:07:35" (2/3) ... [2021-03-11 20:07:37,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1060ab39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:07:37, skipping insertion in model container [2021-03-11 20:07:37,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:07:37" (3/3) ... [2021-03-11 20:07:37,166 INFO L111 eAbstractionObserver]: Analyzing ICFG mix032_pso.oepc.i [2021-03-11 20:07:37,171 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 20:07:37,174 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 20:07:37,175 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 20:07:37,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,207 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,207 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,207 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,207 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,208 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,208 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,208 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,208 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,212 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,212 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,212 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,212 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,215 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,215 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,215 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,215 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,219 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,219 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,219 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,219 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,231 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,231 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,231 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,235 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,235 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,235 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,235 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,235 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,235 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,235 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,235 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,236 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,236 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,237 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,237 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,239 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,240 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:37,241 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 20:07:37,253 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-11 20:07:37,278 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 20:07:37,278 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 20:07:37,278 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 20:07:37,278 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 20:07:37,278 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 20:07:37,278 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 20:07:37,278 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 20:07:37,278 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 20:07:37,285 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2021-03-11 20:07:37,325 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2021-03-11 20:07:37,326 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:07:37,336 INFO L84 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2021-03-11 20:07:37,336 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2021-03-11 20:07:37,342 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2021-03-11 20:07:37,345 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 20:07:37,351 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2021-03-11 20:07:37,353 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2021-03-11 20:07:37,353 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2021-03-11 20:07:37,365 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2021-03-11 20:07:37,365 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:07:37,365 INFO L84 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2021-03-11 20:07:37,367 INFO L116 LiptonReduction]: Number of co-enabled transitions 2054 [2021-03-11 20:07:38,062 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-11 20:07:38,439 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-11 20:07:38,549 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-11 20:07:41,549 WARN L205 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-11 20:07:41,713 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-11 20:07:42,036 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-11 20:07:42,190 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-11 20:07:42,222 INFO L131 LiptonReduction]: Checked pairs total: 6024 [2021-03-11 20:07:42,223 INFO L133 LiptonReduction]: Total number of compositions: 91 [2021-03-11 20:07:42,224 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4882 [2021-03-11 20:07:42,229 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-03-11 20:07:42,229 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:07:42,229 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:07:42,229 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-03-11 20:07:42,229 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:07:42,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:07:42,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1090330, now seen corresponding path program 1 times [2021-03-11 20:07:42,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:07:42,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566313179] [2021-03-11 20:07:42,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:07:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:07:42,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:42,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:42,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:07:42,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566313179] [2021-03-11 20:07:42,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:07:42,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:07:42,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265468975] [2021-03-11 20:07:42,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:07:42,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:07:42,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:07:42,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:07:42,392 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 198 [2021-03-11 20:07:42,394 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:42,394 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:07:42,394 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 198 [2021-03-11 20:07:42,395 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:07:42,469 INFO L129 PetriNetUnfolder]: 49/140 cut-off events. [2021-03-11 20:07:42,469 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:07:42,471 INFO L84 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 140 events. 49/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 625 event pairs, 38 based on Foata normal form. 17/141 useless extension candidates. Maximal degree in co-relation 226. Up to 65 conditions per place. [2021-03-11 20:07:42,473 INFO L132 encePairwiseOnDemand]: 194/198 looper letters, 9 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2021-03-11 20:07:42,473 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 28 transitions, 87 flow [2021-03-11 20:07:42,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:07:42,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:07:42,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2021-03-11 20:07:42,487 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8821548821548821 [2021-03-11 20:07:42,488 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2021-03-11 20:07:42,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2021-03-11 20:07:42,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:07:42,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2021-03-11 20:07:42,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:42,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:42,503 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:42,504 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 524 transitions. [2021-03-11 20:07:42,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 28 transitions, 87 flow [2021-03-11 20:07:42,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 84 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-11 20:07:42,507 INFO L241 Difference]: Finished difference. Result has 33 places, 24 transitions, 58 flow [2021-03-11 20:07:42,508 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2021-03-11 20:07:42,508 INFO L335 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2021-03-11 20:07:42,509 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-11 20:07:42,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:42,509 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:07:42,509 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:07:42,509 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 20:07:42,509 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:07:42,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:07:42,510 INFO L82 PathProgramCache]: Analyzing trace with hash 476510097, now seen corresponding path program 1 times [2021-03-11 20:07:42,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:07:42,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838758208] [2021-03-11 20:07:42,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:07:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:07:42,596 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-11 20:07:42,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:07:42,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:07:42,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838758208] [2021-03-11 20:07:42,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:07:42,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:07:42,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176475853] [2021-03-11 20:07:42,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:07:42,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:07:42,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:07:42,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:07:42,610 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 198 [2021-03-11 20:07:42,610 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:42,610 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:07:42,610 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 198 [2021-03-11 20:07:42,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:07:42,663 INFO L129 PetriNetUnfolder]: 92/230 cut-off events. [2021-03-11 20:07:42,663 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:07:42,663 INFO L84 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 230 events. 92/230 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1201 event pairs, 32 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 394. Up to 144 conditions per place. [2021-03-11 20:07:42,664 INFO L132 encePairwiseOnDemand]: 190/198 looper letters, 6 selfloop transitions, 4 changer transitions 4/30 dead transitions. [2021-03-11 20:07:42,664 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 98 flow [2021-03-11 20:07:42,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:07:42,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:07:42,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2021-03-11 20:07:42,668 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8434343434343434 [2021-03-11 20:07:42,668 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 501 transitions. [2021-03-11 20:07:42,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 501 transitions. [2021-03-11 20:07:42,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:07:42,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 501 transitions. [2021-03-11 20:07:42,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:42,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:42,671 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:42,671 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 3 states and 501 transitions. [2021-03-11 20:07:42,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 98 flow [2021-03-11 20:07:42,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:07:42,672 INFO L241 Difference]: Finished difference. Result has 34 places, 26 transitions, 82 flow [2021-03-11 20:07:42,672 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2021-03-11 20:07:42,672 INFO L335 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2021-03-11 20:07:42,673 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 82 flow [2021-03-11 20:07:42,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:42,673 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:07:42,673 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:07:42,673 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 20:07:42,674 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:07:42,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:07:42,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1635302412, now seen corresponding path program 1 times [2021-03-11 20:07:42,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:07:42,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901764129] [2021-03-11 20:07:42,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:07:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:07:42,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:42,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:42,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:07:42,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901764129] [2021-03-11 20:07:42,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:07:42,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:07:42,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410124498] [2021-03-11 20:07:42,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:07:42,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:07:42,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:07:42,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:07:42,755 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 198 [2021-03-11 20:07:42,756 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:42,756 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:07:42,756 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 198 [2021-03-11 20:07:42,756 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:07:42,774 INFO L129 PetriNetUnfolder]: 36/98 cut-off events. [2021-03-11 20:07:42,775 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-03-11 20:07:42,775 INFO L84 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 98 events. 36/98 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 352 event pairs, 18 based on Foata normal form. 2/98 useless extension candidates. Maximal degree in co-relation 186. Up to 66 conditions per place. [2021-03-11 20:07:42,775 INFO L132 encePairwiseOnDemand]: 195/198 looper letters, 1 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2021-03-11 20:07:42,775 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 26 transitions, 90 flow [2021-03-11 20:07:42,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:07:42,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:07:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2021-03-11 20:07:42,779 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8804713804713805 [2021-03-11 20:07:42,779 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 523 transitions. [2021-03-11 20:07:42,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 523 transitions. [2021-03-11 20:07:42,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:07:42,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 523 transitions. [2021-03-11 20:07:42,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:42,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:42,781 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:42,781 INFO L185 Difference]: Start difference. First operand has 34 places, 26 transitions, 82 flow. Second operand 3 states and 523 transitions. [2021-03-11 20:07:42,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 26 transitions, 90 flow [2021-03-11 20:07:42,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 86 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 20:07:42,783 INFO L241 Difference]: Finished difference. Result has 35 places, 26 transitions, 89 flow [2021-03-11 20:07:42,783 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2021-03-11 20:07:42,783 INFO L335 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2021-03-11 20:07:42,783 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 89 flow [2021-03-11 20:07:42,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:42,783 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:07:42,784 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:07:42,784 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 20:07:42,784 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:07:42,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:07:42,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1635324701, now seen corresponding path program 1 times [2021-03-11 20:07:42,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:07:42,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888172134] [2021-03-11 20:07:42,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:07:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:07:42,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:42,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:42,848 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-11 20:07:42,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:07:42,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:07:42,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888172134] [2021-03-11 20:07:42,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:07:42,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:07:42,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775292474] [2021-03-11 20:07:42,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:07:42,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:07:42,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:07:42,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:07:42,858 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 198 [2021-03-11 20:07:42,859 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:42,859 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:07:42,859 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 198 [2021-03-11 20:07:42,859 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:07:42,880 INFO L129 PetriNetUnfolder]: 28/94 cut-off events. [2021-03-11 20:07:42,880 INFO L130 PetriNetUnfolder]: For 25/39 co-relation queries the response was YES. [2021-03-11 20:07:42,881 INFO L84 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 94 events. 28/94 cut-off events. For 25/39 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 12 based on Foata normal form. 5/98 useless extension candidates. Maximal degree in co-relation 222. Up to 54 conditions per place. [2021-03-11 20:07:42,881 INFO L132 encePairwiseOnDemand]: 195/198 looper letters, 10 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-03-11 20:07:42,881 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 29 transitions, 130 flow [2021-03-11 20:07:42,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:07:42,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:07:42,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2021-03-11 20:07:42,883 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8367003367003367 [2021-03-11 20:07:42,883 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 497 transitions. [2021-03-11 20:07:42,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions. [2021-03-11 20:07:42,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:07:42,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions. [2021-03-11 20:07:42,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:42,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:42,885 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:42,885 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 89 flow. Second operand 3 states and 497 transitions. [2021-03-11 20:07:42,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 29 transitions, 130 flow [2021-03-11 20:07:42,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:07:42,887 INFO L241 Difference]: Finished difference. Result has 36 places, 26 transitions, 94 flow [2021-03-11 20:07:42,887 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2021-03-11 20:07:42,887 INFO L335 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2021-03-11 20:07:42,887 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 94 flow [2021-03-11 20:07:42,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:42,887 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:07:42,887 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:07:42,888 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 20:07:42,888 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:07:42,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:07:42,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1217071602, now seen corresponding path program 1 times [2021-03-11 20:07:42,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:07:42,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538343881] [2021-03-11 20:07:42,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:07:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:07:42,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:42,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:42,919 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 20:07:42,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:07:42,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:42,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:07:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:07:42,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538343881] [2021-03-11 20:07:42,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:07:42,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:07:42,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363835247] [2021-03-11 20:07:42,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:07:42,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:07:42,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:07:42,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:07:42,926 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 198 [2021-03-11 20:07:42,927 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:42,927 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:07:42,927 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 198 [2021-03-11 20:07:42,927 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:07:42,960 INFO L129 PetriNetUnfolder]: 84/220 cut-off events. [2021-03-11 20:07:42,961 INFO L130 PetriNetUnfolder]: For 57/62 co-relation queries the response was YES. [2021-03-11 20:07:42,962 INFO L84 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 220 events. 84/220 cut-off events. For 57/62 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1127 event pairs, 37 based on Foata normal form. 21/227 useless extension candidates. Maximal degree in co-relation 471. Up to 105 conditions per place. [2021-03-11 20:07:42,962 INFO L132 encePairwiseOnDemand]: 192/198 looper letters, 8 selfloop transitions, 8 changer transitions 0/36 dead transitions. [2021-03-11 20:07:42,962 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 146 flow [2021-03-11 20:07:42,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:07:42,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:07:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 828 transitions. [2021-03-11 20:07:42,964 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8363636363636363 [2021-03-11 20:07:42,964 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 828 transitions. [2021-03-11 20:07:42,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 828 transitions. [2021-03-11 20:07:42,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:07:42,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 828 transitions. [2021-03-11 20:07:42,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 165.6) internal successors, (828), 5 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:42,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:42,968 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:42,968 INFO L185 Difference]: Start difference. First operand has 36 places, 26 transitions, 94 flow. Second operand 5 states and 828 transitions. [2021-03-11 20:07:42,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 146 flow [2021-03-11 20:07:42,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:07:42,969 INFO L241 Difference]: Finished difference. Result has 41 places, 33 transitions, 148 flow [2021-03-11 20:07:42,969 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2021-03-11 20:07:42,970 INFO L335 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2021-03-11 20:07:42,970 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 148 flow [2021-03-11 20:07:42,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:42,970 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:07:42,970 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:07:42,970 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 20:07:42,970 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:07:42,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:07:42,971 INFO L82 PathProgramCache]: Analyzing trace with hash 2032469384, now seen corresponding path program 1 times [2021-03-11 20:07:42,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:07:42,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426861311] [2021-03-11 20:07:42,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:07:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:07:42,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:42,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:07:42,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:42,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:43,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:43,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:07:43,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426861311] [2021-03-11 20:07:43,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:07:43,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:07:43,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749288954] [2021-03-11 20:07:43,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:07:43,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:07:43,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:07:43,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:07:43,005 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 198 [2021-03-11 20:07:43,006 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:43,006 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:07:43,006 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 198 [2021-03-11 20:07:43,006 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:07:43,066 INFO L129 PetriNetUnfolder]: 122/316 cut-off events. [2021-03-11 20:07:43,066 INFO L130 PetriNetUnfolder]: For 379/483 co-relation queries the response was YES. [2021-03-11 20:07:43,067 INFO L84 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 316 events. 122/316 cut-off events. For 379/483 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 1878 event pairs, 50 based on Foata normal form. 19/302 useless extension candidates. Maximal degree in co-relation 867. Up to 166 conditions per place. [2021-03-11 20:07:43,069 INFO L132 encePairwiseOnDemand]: 195/198 looper letters, 3 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2021-03-11 20:07:43,069 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 34 transitions, 162 flow [2021-03-11 20:07:43,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 20:07:43,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 20:07:43,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 674 transitions. [2021-03-11 20:07:43,070 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.851010101010101 [2021-03-11 20:07:43,070 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 674 transitions. [2021-03-11 20:07:43,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 674 transitions. [2021-03-11 20:07:43,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:07:43,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 674 transitions. [2021-03-11 20:07:43,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 168.5) internal successors, (674), 4 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:43,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:43,073 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:43,074 INFO L185 Difference]: Start difference. First operand has 41 places, 33 transitions, 148 flow. Second operand 4 states and 674 transitions. [2021-03-11 20:07:43,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 34 transitions, 162 flow [2021-03-11 20:07:43,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 34 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 20:07:43,077 INFO L241 Difference]: Finished difference. Result has 45 places, 34 transitions, 159 flow [2021-03-11 20:07:43,077 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2021-03-11 20:07:43,078 INFO L335 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2021-03-11 20:07:43,078 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 159 flow [2021-03-11 20:07:43,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:43,078 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:07:43,078 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:07:43,078 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 20:07:43,078 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:07:43,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:07:43,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1131714590, now seen corresponding path program 2 times [2021-03-11 20:07:43,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:07:43,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375782739] [2021-03-11 20:07:43,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:07:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:07:43,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:43,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:43,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:43,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:43,129 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 20:07:43,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:07:43,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:43,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:07:43,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:07:43,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375782739] [2021-03-11 20:07:43,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:07:43,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:07:43,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093986922] [2021-03-11 20:07:43,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:07:43,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:07:43,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:07:43,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:07:43,137 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 198 [2021-03-11 20:07:43,138 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 159 flow. Second operand has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:43,138 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:07:43,138 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 198 [2021-03-11 20:07:43,138 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:07:43,207 INFO L129 PetriNetUnfolder]: 79/246 cut-off events. [2021-03-11 20:07:43,207 INFO L130 PetriNetUnfolder]: For 354/649 co-relation queries the response was YES. [2021-03-11 20:07:43,208 INFO L84 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 246 events. 79/246 cut-off events. For 354/649 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1378 event pairs, 12 based on Foata normal form. 117/349 useless extension candidates. Maximal degree in co-relation 814. Up to 141 conditions per place. [2021-03-11 20:07:43,209 INFO L132 encePairwiseOnDemand]: 192/198 looper letters, 5 selfloop transitions, 15 changer transitions 3/44 dead transitions. [2021-03-11 20:07:43,209 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 44 transitions, 263 flow [2021-03-11 20:07:43,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:07:43,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:07:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1159 transitions. [2021-03-11 20:07:43,211 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8362193362193362 [2021-03-11 20:07:43,211 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1159 transitions. [2021-03-11 20:07:43,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1159 transitions. [2021-03-11 20:07:43,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:07:43,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1159 transitions. [2021-03-11 20:07:43,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 165.57142857142858) internal successors, (1159), 7 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:43,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:43,215 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:43,215 INFO L185 Difference]: Start difference. First operand has 45 places, 34 transitions, 159 flow. Second operand 7 states and 1159 transitions. [2021-03-11 20:07:43,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 44 transitions, 263 flow [2021-03-11 20:07:43,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 44 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 20:07:43,218 INFO L241 Difference]: Finished difference. Result has 53 places, 41 transitions, 257 flow [2021-03-11 20:07:43,218 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=257, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2021-03-11 20:07:43,218 INFO L335 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2021-03-11 20:07:43,218 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 257 flow [2021-03-11 20:07:43,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:43,219 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:07:43,219 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:07:43,219 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 20:07:43,219 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:07:43,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:07:43,219 INFO L82 PathProgramCache]: Analyzing trace with hash 558970404, now seen corresponding path program 1 times [2021-03-11 20:07:43,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:07:43,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647435570] [2021-03-11 20:07:43,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:07:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:07:43,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:43,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:43,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:43,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:43,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:43,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:43,297 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 20:07:43,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:07:43,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:43,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:07:43,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:07:43,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647435570] [2021-03-11 20:07:43,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:07:43,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:07:43,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757783069] [2021-03-11 20:07:43,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:07:43,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:07:43,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:07:43,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:07:43,304 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 198 [2021-03-11 20:07:43,305 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 257 flow. Second operand has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:43,305 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:07:43,305 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 198 [2021-03-11 20:07:43,305 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:07:43,375 INFO L129 PetriNetUnfolder]: 60/204 cut-off events. [2021-03-11 20:07:43,376 INFO L130 PetriNetUnfolder]: For 884/1394 co-relation queries the response was YES. [2021-03-11 20:07:43,376 INFO L84 FinitePrefix]: Finished finitePrefix Result has 890 conditions, 204 events. 60/204 cut-off events. For 884/1394 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1137 event pairs, 6 based on Foata normal form. 135/326 useless extension candidates. Maximal degree in co-relation 868. Up to 121 conditions per place. [2021-03-11 20:07:43,377 INFO L132 encePairwiseOnDemand]: 192/198 looper letters, 2 selfloop transitions, 17 changer transitions 7/45 dead transitions. [2021-03-11 20:07:43,377 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 45 transitions, 335 flow [2021-03-11 20:07:43,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 20:07:43,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 20:07:43,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1484 transitions. [2021-03-11 20:07:43,379 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8327721661054994 [2021-03-11 20:07:43,379 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1484 transitions. [2021-03-11 20:07:43,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1484 transitions. [2021-03-11 20:07:43,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:07:43,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1484 transitions. [2021-03-11 20:07:43,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 164.88888888888889) internal successors, (1484), 9 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-03-11 20:07:43,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:43,386 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:43,386 INFO L185 Difference]: Start difference. First operand has 53 places, 41 transitions, 257 flow. Second operand 9 states and 1484 transitions. [2021-03-11 20:07:43,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 45 transitions, 335 flow [2021-03-11 20:07:43,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 45 transitions, 288 flow, removed 16 selfloop flow, removed 4 redundant places. [2021-03-11 20:07:43,390 INFO L241 Difference]: Finished difference. Result has 60 places, 38 transitions, 240 flow [2021-03-11 20:07:43,390 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=240, PETRI_PLACES=60, PETRI_TRANSITIONS=38} [2021-03-11 20:07:43,390 INFO L335 CegarLoopForPetriNet]: 35 programPoint places, 25 predicate places. [2021-03-11 20:07:43,390 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 38 transitions, 240 flow [2021-03-11 20:07:43,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:43,390 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:07:43,391 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:07:43,391 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 20:07:43,391 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:07:43,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:07:43,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1963419862, now seen corresponding path program 1 times [2021-03-11 20:07:43,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:07:43,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393262716] [2021-03-11 20:07:43,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:07:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:07:43,451 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:07:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:07:43,509 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:07:43,545 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 20:07:43,545 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 20:07:43,546 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 20:07:43,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:07:43 BasicIcfg [2021-03-11 20:07:43,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 20:07:43,622 INFO L168 Benchmark]: Toolchain (without parser) took 8391.07 ms. Allocated memory was 255.9 MB in the beginning and 545.3 MB in the end (delta: 289.4 MB). Free memory was 236.8 MB in the beginning and 360.3 MB in the end (delta: -123.5 MB). Peak memory consumption was 165.7 MB. Max. memory is 16.0 GB. [2021-03-11 20:07:43,622 INFO L168 Benchmark]: CDTParser took 0.08 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 20:07:43,622 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.16 ms. Allocated memory was 255.9 MB in the beginning and 377.5 MB in the end (delta: 121.6 MB). Free memory was 236.1 MB in the beginning and 337.0 MB in the end (delta: -100.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. [2021-03-11 20:07:43,623 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.12 ms. Allocated memory is still 377.5 MB. Free memory was 337.0 MB in the beginning and 334.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:07:43,623 INFO L168 Benchmark]: Boogie Preprocessor took 29.28 ms. Allocated memory is still 377.5 MB. Free memory was 334.0 MB in the beginning and 332.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:07:43,623 INFO L168 Benchmark]: RCFGBuilder took 1448.34 ms. Allocated memory is still 377.5 MB. Free memory was 332.1 MB in the beginning and 314.1 MB in the end (delta: 18.0 MB). Peak memory consumption was 63.4 MB. Max. memory is 16.0 GB. [2021-03-11 20:07:43,623 INFO L168 Benchmark]: TraceAbstraction took 6459.55 ms. Allocated memory was 377.5 MB in the beginning and 545.3 MB in the end (delta: 167.8 MB). Free memory was 314.1 MB in the beginning and 360.3 MB in the end (delta: -46.2 MB). Peak memory consumption was 122.6 MB. Max. memory is 16.0 GB. [2021-03-11 20:07:43,625 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.08 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 400.16 ms. Allocated memory was 255.9 MB in the beginning and 377.5 MB in the end (delta: 121.6 MB). Free memory was 236.1 MB in the beginning and 337.0 MB in the end (delta: -100.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 47.12 ms. Allocated memory is still 377.5 MB. Free memory was 337.0 MB in the beginning and 334.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 29.28 ms. Allocated memory is still 377.5 MB. Free memory was 334.0 MB in the beginning and 332.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1448.34 ms. Allocated memory is still 377.5 MB. Free memory was 332.1 MB in the beginning and 314.1 MB in the end (delta: 18.0 MB). Peak memory consumption was 63.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 6459.55 ms. Allocated memory was 377.5 MB in the beginning and 545.3 MB in the end (delta: 167.8 MB). Free memory was 314.1 MB in the beginning and 360.3 MB in the end (delta: -46.2 MB). Peak memory consumption was 122.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4869.6ms, 112 PlacesBefore, 35 PlacesAfterwards, 104 TransitionsBefore, 26 TransitionsAfterwards, 2054 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 91 TotalNumberOfCompositions, 6024 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3102, positive: 2889, positive conditional: 0, positive unconditional: 2889, negative: 213, negative conditional: 0, negative unconditional: 213, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1577, positive: 1516, positive conditional: 0, positive unconditional: 1516, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1577, positive: 1496, positive conditional: 0, positive unconditional: 1496, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 81, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 706, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 651, negative conditional: 0, negative unconditional: 651, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3102, positive: 1373, positive conditional: 0, positive unconditional: 1373, negative: 152, negative conditional: 0, negative unconditional: 152, unknown: 1577, unknown conditional: 0, unknown unconditional: 1577] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 173, Positive conditional cache size: 0, Positive unconditional cache size: 173, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - 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; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L723] 0 int b = 0; [L724] 0 _Bool b$flush_delayed; [L725] 0 int b$mem_tmp; [L726] 0 _Bool b$r_buff0_thd0; [L727] 0 _Bool b$r_buff0_thd1; [L728] 0 _Bool b$r_buff0_thd2; [L729] 0 _Bool b$r_buff0_thd3; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$read_delayed; [L735] 0 int *b$read_delayed_var; [L736] 0 int b$w_buff0; [L737] 0 _Bool b$w_buff0_used; [L738] 0 int b$w_buff1; [L739] 0 _Bool b$w_buff1_used; [L740] 0 _Bool main$tmp_guard0; [L741] 0 _Bool main$tmp_guard1; [L743] 0 int x = 0; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L855] 0 pthread_t t855; [L856] FCALL, FORK 0 pthread_create(&t855, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 b$w_buff1 = b$w_buff0 [L754] 1 b$w_buff0 = 1 [L755] 1 b$w_buff1_used = b$w_buff0_used [L756] 1 b$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L758] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L759] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L760] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L761] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t856; [L858] FCALL, FORK 0 pthread_create(&t856, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L788] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L791] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L859] 0 pthread_t t857; [L860] FCALL, FORK 0 pthread_create(&t857, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L811] 3 a = 1 [L814] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 b$flush_delayed = weak$$choice2 [L820] 3 b$mem_tmp = b [L821] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L821] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L822] EXPR 3 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L822] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0) [L822] EXPR 3 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L822] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L823] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L823] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1) [L823] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L823] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L824] EXPR 3 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L824] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used) [L824] EXPR 3 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L824] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L825] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L825] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 3 weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L826] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3) [L826] EXPR 3 weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L826] 3 b$r_buff0_thd3 = weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L827] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L827] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = b [L829] EXPR 3 b$flush_delayed ? b$mem_tmp : b [L829] 3 b = b$flush_delayed ? b$mem_tmp : b [L830] 3 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L794] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L794] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b [L794] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L794] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L795] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L795] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L796] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L796] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L797] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L797] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L798] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L798] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L768] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L833] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L833] EXPR 3 b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b [L833] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L833] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L834] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L834] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L835] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L835] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L836] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L836] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L837] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L837] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L842] 3 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L866] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L866] EXPR 0 b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b [L866] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L866] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L867] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L867] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L868] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L868] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L869] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L869] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L870] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L870] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 106 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 6270.4ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 527.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4948.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 39 SDtfs, 17 SDslu, 14 SDs, 0 SdLazy, 108 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 108.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 84.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=257occurred in iteration=7, InterpolantAutomatonStates: 37, 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: 18.4ms SsaConstructionTime, 227.3ms SatisfiabilityAnalysisTime, 299.0ms InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 432 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...