/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-FA-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix043_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 11:09:08,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 11:09:08,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 11:09:08,273 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 11:09:08,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 11:09:08,276 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 11:09:08,277 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 11:09:08,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 11:09:08,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 11:09:08,287 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 11:09:08,288 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 11:09:08,289 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 11:09:08,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 11:09:08,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 11:09:08,292 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 11:09:08,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 11:09:08,294 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 11:09:08,295 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 11:09:08,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 11:09:08,303 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 11:09:08,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 11:09:08,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 11:09:08,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 11:09:08,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 11:09:08,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 11:09:08,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 11:09:08,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 11:09:08,314 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 11:09:08,314 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 11:09:08,315 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 11:09:08,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 11:09:08,316 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 11:09:08,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 11:09:08,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 11:09:08,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 11:09:08,318 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 11:09:08,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 11:09:08,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 11:09:08,319 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 11:09:08,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 11:09:08,320 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 11:09:08,323 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-FA-SemanticLbe.epf [2021-03-11 11:09:08,350 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 11:09:08,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 11:09:08,353 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 11:09:08,353 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 11:09:08,353 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 11:09:08,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 11:09:08,354 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 11:09:08,354 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 11:09:08,354 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 11:09:08,354 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 11:09:08,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 11:09:08,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 11:09:08,355 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 11:09:08,355 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 11:09:08,355 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 11:09:08,355 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 11:09:08,355 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 11:09:08,356 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 11:09:08,356 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 11:09:08,356 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 11:09:08,356 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 11:09:08,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 11:09:08,356 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 11:09:08,356 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 11:09:08,357 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 11:09:08,357 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 11:09:08,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 11:09:08,357 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-03-11 11:09:08,357 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 11:09:08,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 11:09:08,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 11:09:08,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 11:09:08,603 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 11:09:08,604 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 11:09:08,604 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_power.opt.i [2021-03-11 11:09:08,659 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1445d858c/23b246329aa24bebb12ab09c3358103d/FLAGb2bec2051 [2021-03-11 11:09:09,066 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 11:09:09,067 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_power.opt.i [2021-03-11 11:09:09,082 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1445d858c/23b246329aa24bebb12ab09c3358103d/FLAGb2bec2051 [2021-03-11 11:09:09,403 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1445d858c/23b246329aa24bebb12ab09c3358103d [2021-03-11 11:09:09,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 11:09:09,408 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 11:09:09,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 11:09:09,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 11:09:09,412 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 11:09:09,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:09:09" (1/1) ... [2021-03-11 11:09:09,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@670014bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:09:09, skipping insertion in model container [2021-03-11 11:09:09,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:09:09" (1/1) ... [2021-03-11 11:09:09,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 11:09:09,458 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 11:09:09,551 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/mix043_power.opt.i[950,963] [2021-03-11 11:09:09,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 11:09:09,757 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 11:09:09,765 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/mix043_power.opt.i[950,963] [2021-03-11 11:09:09,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 11:09:09,858 INFO L208 MainTranslator]: Completed translation [2021-03-11 11:09:09,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:09:09 WrapperNode [2021-03-11 11:09:09,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 11:09:09,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 11:09:09,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 11:09:09,861 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 11:09:09,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:09:09" (1/1) ... [2021-03-11 11:09:09,893 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:09:09" (1/1) ... [2021-03-11 11:09:09,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 11:09:09,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 11:09:09,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 11:09:09,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 11:09:09,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:09:09" (1/1) ... [2021-03-11 11:09:09,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:09:09" (1/1) ... [2021-03-11 11:09:09,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:09:09" (1/1) ... [2021-03-11 11:09:09,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:09:09" (1/1) ... [2021-03-11 11:09:09,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:09:09" (1/1) ... [2021-03-11 11:09:09,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:09:09" (1/1) ... [2021-03-11 11:09:09,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:09:09" (1/1) ... [2021-03-11 11:09:09,961 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 11:09:09,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 11:09:09,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 11:09:09,962 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 11:09:09,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:09:09" (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 11:09:10,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 11:09:10,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 11:09:10,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 11:09:10,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 11:09:10,011 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 11:09:10,011 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 11:09:10,012 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 11:09:10,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 11:09:10,012 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 11:09:10,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 11:09:10,012 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-11 11:09:10,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-11 11:09:10,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 11:09:10,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 11:09:10,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 11:09:10,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 11:09:10,014 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 11:09:11,200 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 11:09:11,201 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 11:09:11,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:09:11 BoogieIcfgContainer [2021-03-11 11:09:11,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 11:09:11,203 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 11:09:11,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 11:09:11,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 11:09:11,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 11:09:09" (1/3) ... [2021-03-11 11:09:11,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64efdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:09:11, skipping insertion in model container [2021-03-11 11:09:11,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:09:09" (2/3) ... [2021-03-11 11:09:11,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64efdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:09:11, skipping insertion in model container [2021-03-11 11:09:11,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:09:11" (3/3) ... [2021-03-11 11:09:11,206 INFO L111 eAbstractionObserver]: Analyzing ICFG mix043_power.opt.i [2021-03-11 11:09:11,211 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-03-11 11:09:11,211 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 11:09:11,214 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 11:09:11,214 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 11:09:11,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,236 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,236 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,236 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,236 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,237 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,237 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,237 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,237 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,238 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,238 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,238 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,239 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,241 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,241 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,241 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,241 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,241 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,241 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,241 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,241 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,241 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,241 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,242 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,242 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,242 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,242 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,242 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,242 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,242 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,242 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,242 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,242 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,243 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,243 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,243 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,243 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,243 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,243 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,243 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,243 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,243 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,243 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,244 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,244 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,244 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,244 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,245 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,245 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,246 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,246 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,247 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,247 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,248 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,248 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,250 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,250 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,250 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,250 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,250 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,250 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,250 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,250 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,250 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,251 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,251 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,251 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:09:11,251 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 11:09:11,262 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-11 11:09:11,274 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 11:09:11,274 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 11:09:11,274 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 11:09:11,274 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 11:09:11,274 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 11:09:11,275 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 11:09:11,275 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 11:09:11,275 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 11:09:11,283 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 11:09:11,290 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 118 transitions, 256 flow [2021-03-11 11:09:11,291 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 118 transitions, 256 flow [2021-03-11 11:09:11,292 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 118 transitions, 256 flow [2021-03-11 11:09:11,321 INFO L129 PetriNetUnfolder]: 2/114 cut-off events. [2021-03-11 11:09:11,322 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 11:09:11,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-11 11:09:11,327 INFO L116 LiptonReduction]: Number of co-enabled transitions 2598 [2021-03-11 11:09:12,334 WARN L205 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2021-03-11 11:09:12,854 WARN L205 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 187 [2021-03-11 11:09:14,124 WARN L205 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-03-11 11:09:14,664 WARN L205 SmtUtils]: Spent 536.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-11 11:09:15,050 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-11 11:09:15,427 WARN L205 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-11 11:09:15,554 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-11 11:09:16,623 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-11 11:09:16,748 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-11 11:09:17,906 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-11 11:09:18,201 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-11 11:09:19,324 WARN L205 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 270 DAG size of output: 269 [2021-03-11 11:09:19,909 WARN L205 SmtUtils]: Spent 583.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-11 11:09:20,180 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2021-03-11 11:09:20,443 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2021-03-11 11:09:21,022 WARN L205 SmtUtils]: Spent 577.00 ms on a formula simplification that was a NOOP. DAG size: 273 [2021-03-11 11:09:21,608 WARN L205 SmtUtils]: Spent 583.00 ms on a formula simplification that was a NOOP. DAG size: 273 [2021-03-11 11:09:22,543 WARN L205 SmtUtils]: Spent 534.00 ms on a formula simplification that was a NOOP. DAG size: 206 [2021-03-11 11:09:23,078 WARN L205 SmtUtils]: Spent 533.00 ms on a formula simplification that was a NOOP. DAG size: 206 [2021-03-11 11:09:23,722 WARN L205 SmtUtils]: Spent 642.00 ms on a formula simplification that was a NOOP. DAG size: 286 [2021-03-11 11:09:24,339 WARN L205 SmtUtils]: Spent 616.00 ms on a formula simplification that was a NOOP. DAG size: 286 [2021-03-11 11:09:24,890 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-11 11:09:25,011 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-11 11:09:25,126 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-11 11:09:25,238 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-11 11:09:25,589 WARN L205 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-11 11:09:25,745 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-11 11:09:26,067 WARN L205 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-11 11:09:26,235 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-11 11:09:26,248 INFO L131 LiptonReduction]: Checked pairs total: 6938 [2021-03-11 11:09:26,249 INFO L133 LiptonReduction]: Total number of compositions: 99 [2021-03-11 11:09:26,254 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2021-03-11 11:09:26,368 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3002 states, 2998 states have (on average 4.090727151434289) internal successors, (12264), 3001 states have internal predecessors, (12264), 0 states have call successors, (0), 0 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 11:09:26,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 3002 states, 2998 states have (on average 4.090727151434289) internal successors, (12264), 3001 states have internal predecessors, (12264), 0 states have call successors, (0), 0 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 11:09:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-03-11 11:09:26,380 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:09:26,380 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:09:26,381 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:09:26,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:09:26,384 INFO L82 PathProgramCache]: Analyzing trace with hash 92512463, now seen corresponding path program 1 times [2021-03-11 11:09:26,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:09:26,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873526215] [2021-03-11 11:09:26,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:09:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:09:26,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:26,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:09:26,563 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 11:09:26,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873526215] [2021-03-11 11:09:26,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:09:26,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 11:09:26,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935346375] [2021-03-11 11:09:26,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 11:09:26,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:09:26,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 11:09:26,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:09:26,585 INFO L87 Difference]: Start difference. First operand has 3002 states, 2998 states have (on average 4.090727151434289) internal successors, (12264), 3001 states have internal predecessors, (12264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 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 11:09:26,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:09:26,652 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2021-03-11 11:09:26,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 11:09:26,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-03-11 11:09:26,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:09:26,680 INFO L225 Difference]: With dead ends: 2602 [2021-03-11 11:09:26,681 INFO L226 Difference]: Without dead ends: 2122 [2021-03-11 11:09:26,681 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:09:26,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2021-03-11 11:09:26,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2021-03-11 11:09:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2122 states, 2121 states have (on average 3.8095238095238093) internal successors, (8080), 2121 states have internal predecessors, (8080), 0 states have call successors, (0), 0 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 11:09:26,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8080 transitions. [2021-03-11 11:09:26,805 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 8080 transitions. Word has length 9 [2021-03-11 11:09:26,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:09:26,805 INFO L480 AbstractCegarLoop]: Abstraction has 2122 states and 8080 transitions. [2021-03-11 11:09:26,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 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 11:09:26,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 8080 transitions. [2021-03-11 11:09:26,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-03-11 11:09:26,808 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:09:26,808 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:09:26,809 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 11:09:26,809 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:09:26,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:09:26,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1289777393, now seen corresponding path program 1 times [2021-03-11 11:09:26,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:09:26,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505374298] [2021-03-11 11:09:26,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:09:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:09:26,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:26,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:09:26,897 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 11:09:26,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505374298] [2021-03-11 11:09:26,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:09:26,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 11:09:26,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721625693] [2021-03-11 11:09:26,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 11:09:26,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:09:26,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 11:09:26,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:09:26,899 INFO L87 Difference]: Start difference. First operand 2122 states and 8080 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 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 11:09:26,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:09:26,920 INFO L93 Difference]: Finished difference Result 1962 states and 7392 transitions. [2021-03-11 11:09:26,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 11:09:26,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-03-11 11:09:26,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:09:26,935 INFO L225 Difference]: With dead ends: 1962 [2021-03-11 11:09:26,935 INFO L226 Difference]: Without dead ends: 1962 [2021-03-11 11:09:26,935 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:09:26,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2021-03-11 11:09:26,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2021-03-11 11:09:26,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1961 states have (on average 3.769505354411015) internal successors, (7392), 1961 states have internal predecessors, (7392), 0 states have call successors, (0), 0 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 11:09:26,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 7392 transitions. [2021-03-11 11:09:26,986 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 7392 transitions. Word has length 11 [2021-03-11 11:09:26,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:09:26,987 INFO L480 AbstractCegarLoop]: Abstraction has 1962 states and 7392 transitions. [2021-03-11 11:09:26,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 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 11:09:26,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 7392 transitions. [2021-03-11 11:09:26,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-03-11 11:09:26,988 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:09:26,989 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:09:26,989 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 11:09:26,989 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:09:26,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:09:26,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1742977438, now seen corresponding path program 1 times [2021-03-11 11:09:26,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:09:26,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324053956] [2021-03-11 11:09:26,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:09:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:09:27,085 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-03-11 11:09:27,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:09:27,093 INFO L142 QuantifierPusher]: treesize reduction 40, result has 32.2 percent of original size [2021-03-11 11:09:27,096 INFO L147 QuantifierPusher]: treesize reduction 5, result has 73.7 percent of original size 14 [2021-03-11 11:09:27,126 INFO L142 QuantifierPusher]: treesize reduction 16, result has 72.9 percent of original size [2021-03-11 11:09:27,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-03-11 11:09:27,147 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 11:09:27,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324053956] [2021-03-11 11:09:27,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:09:27,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:09:27,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659861824] [2021-03-11 11:09:27,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 11:09:27,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:09:27,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 11:09:27,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:09:27,148 INFO L87 Difference]: Start difference. First operand 1962 states and 7392 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 11:09:27,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:09:27,205 INFO L93 Difference]: Finished difference Result 2058 states and 7728 transitions. [2021-03-11 11:09:27,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:09:27,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-03-11 11:09:27,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:09:27,215 INFO L225 Difference]: With dead ends: 2058 [2021-03-11 11:09:27,215 INFO L226 Difference]: Without dead ends: 2058 [2021-03-11 11:09:27,216 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 61.7ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:09:27,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2021-03-11 11:09:27,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 2058. [2021-03-11 11:09:27,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2058 states, 2057 states have (on average 3.7569275644141955) internal successors, (7728), 2057 states have internal predecessors, (7728), 0 states have call successors, (0), 0 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 11:09:27,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 7728 transitions. [2021-03-11 11:09:27,270 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 7728 transitions. Word has length 13 [2021-03-11 11:09:27,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:09:27,270 INFO L480 AbstractCegarLoop]: Abstraction has 2058 states and 7728 transitions. [2021-03-11 11:09:27,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 11:09:27,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 7728 transitions. [2021-03-11 11:09:27,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-03-11 11:09:27,275 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:09:27,275 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:09:27,275 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 11:09:27,275 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:09:27,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:09:27,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1769463838, now seen corresponding path program 2 times [2021-03-11 11:09:27,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:09:27,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132704254] [2021-03-11 11:09:27,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:09:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:09:27,393 INFO L142 QuantifierPusher]: treesize reduction 18, result has 48.6 percent of original size [2021-03-11 11:09:27,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 11:09:27,404 INFO L142 QuantifierPusher]: treesize reduction 19, result has 67.2 percent of original size [2021-03-11 11:09:27,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-11 11:09:27,423 INFO L142 QuantifierPusher]: treesize reduction 29, result has 58.0 percent of original size [2021-03-11 11:09:27,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-11 11:09:27,440 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 11:09:27,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132704254] [2021-03-11 11:09:27,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:09:27,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:09:27,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476938341] [2021-03-11 11:09:27,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 11:09:27,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:09:27,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 11:09:27,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:09:27,442 INFO L87 Difference]: Start difference. First operand 2058 states and 7728 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 11:09:27,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:09:27,509 INFO L93 Difference]: Finished difference Result 2250 states and 8352 transitions. [2021-03-11 11:09:27,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:09:27,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-03-11 11:09:27,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:09:27,522 INFO L225 Difference]: With dead ends: 2250 [2021-03-11 11:09:27,522 INFO L226 Difference]: Without dead ends: 2250 [2021-03-11 11:09:27,525 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.8ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:09:27,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2021-03-11 11:09:27,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 2154. [2021-03-11 11:09:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2154 states, 2153 states have (on average 3.7231769623780773) internal successors, (8016), 2153 states have internal predecessors, (8016), 0 states have call successors, (0), 0 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 11:09:27,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 8016 transitions. [2021-03-11 11:09:27,604 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 8016 transitions. Word has length 13 [2021-03-11 11:09:27,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:09:27,604 INFO L480 AbstractCegarLoop]: Abstraction has 2154 states and 8016 transitions. [2021-03-11 11:09:27,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 11:09:27,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 8016 transitions. [2021-03-11 11:09:27,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-03-11 11:09:27,607 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:09:27,607 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:09:27,607 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 11:09:27,607 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:09:27,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:09:27,609 INFO L82 PathProgramCache]: Analyzing trace with hash -116286083, now seen corresponding path program 1 times [2021-03-11 11:09:27,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:09:27,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574138132] [2021-03-11 11:09:27,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:09:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:09:27,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:27,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:09:27,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:27,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:09:27,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:27,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:09:27,697 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 11:09:27,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574138132] [2021-03-11 11:09:27,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:09:27,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:09:27,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171433674] [2021-03-11 11:09:27,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:09:27,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:09:27,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:09:27,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:09:27,700 INFO L87 Difference]: Start difference. First operand 2154 states and 8016 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 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 11:09:27,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:09:27,747 INFO L93 Difference]: Finished difference Result 2262 states and 7675 transitions. [2021-03-11 11:09:27,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:09:27,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-03-11 11:09:27,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:09:27,754 INFO L225 Difference]: With dead ends: 2262 [2021-03-11 11:09:27,754 INFO L226 Difference]: Without dead ends: 1686 [2021-03-11 11:09:27,755 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:09:27,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2021-03-11 11:09:27,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1686. [2021-03-11 11:09:27,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1686 states, 1685 states have (on average 3.3685459940652818) internal successors, (5676), 1685 states have internal predecessors, (5676), 0 states have call successors, (0), 0 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 11:09:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 5676 transitions. [2021-03-11 11:09:27,787 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 5676 transitions. Word has length 15 [2021-03-11 11:09:27,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:09:27,787 INFO L480 AbstractCegarLoop]: Abstraction has 1686 states and 5676 transitions. [2021-03-11 11:09:27,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 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 11:09:27,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 5676 transitions. [2021-03-11 11:09:27,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-03-11 11:09:27,789 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:09:27,789 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:09:27,789 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 11:09:27,789 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:09:27,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:09:27,789 INFO L82 PathProgramCache]: Analyzing trace with hash 689969867, now seen corresponding path program 1 times [2021-03-11 11:09:27,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:09:27,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159089455] [2021-03-11 11:09:27,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:09:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:09:27,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:27,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:09:27,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:27,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:09:27,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:27,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:09:27,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:27,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:09:27,867 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 11:09:27,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159089455] [2021-03-11 11:09:27,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:09:27,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 11:09:27,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093762783] [2021-03-11 11:09:27,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 11:09:27,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:09:27,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 11:09:27,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:09:27,868 INFO L87 Difference]: Start difference. First operand 1686 states and 5676 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 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 11:09:27,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:09:27,915 INFO L93 Difference]: Finished difference Result 1464 states and 4522 transitions. [2021-03-11 11:09:27,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 11:09:27,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-03-11 11:09:27,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:09:27,920 INFO L225 Difference]: With dead ends: 1464 [2021-03-11 11:09:27,921 INFO L226 Difference]: Without dead ends: 1095 [2021-03-11 11:09:27,921 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 14.9ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:09:27,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2021-03-11 11:09:27,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1095. [2021-03-11 11:09:27,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1094 states have (on average 3.0274223034734917) internal successors, (3312), 1094 states have internal predecessors, (3312), 0 states have call successors, (0), 0 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 11:09:27,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 3312 transitions. [2021-03-11 11:09:27,941 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 3312 transitions. Word has length 16 [2021-03-11 11:09:27,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:09:27,941 INFO L480 AbstractCegarLoop]: Abstraction has 1095 states and 3312 transitions. [2021-03-11 11:09:27,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 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 11:09:27,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 3312 transitions. [2021-03-11 11:09:27,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-03-11 11:09:27,943 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:09:27,943 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:09:27,943 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 11:09:27,943 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:09:27,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:09:27,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1533417571, now seen corresponding path program 1 times [2021-03-11 11:09:27,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:09:27,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220455729] [2021-03-11 11:09:27,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:09:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:09:28,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:28,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:09:28,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:28,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:09:28,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:28,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:09:28,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:28,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:09:28,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:28,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:09:28,035 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 11:09:28,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220455729] [2021-03-11 11:09:28,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:09:28,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 11:09:28,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512054340] [2021-03-11 11:09:28,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 11:09:28,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:09:28,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 11:09:28,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:09:28,038 INFO L87 Difference]: Start difference. First operand 1095 states and 3312 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 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 11:09:28,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:09:28,083 INFO L93 Difference]: Finished difference Result 953 states and 2847 transitions. [2021-03-11 11:09:28,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 11:09:28,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-03-11 11:09:28,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:09:28,087 INFO L225 Difference]: With dead ends: 953 [2021-03-11 11:09:28,087 INFO L226 Difference]: Without dead ends: 830 [2021-03-11 11:09:28,088 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 18.4ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:09:28,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2021-03-11 11:09:28,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2021-03-11 11:09:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 829 states have (on average 3.0361881785283473) internal successors, (2517), 829 states have internal predecessors, (2517), 0 states have call successors, (0), 0 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 11:09:28,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 2517 transitions. [2021-03-11 11:09:28,102 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 2517 transitions. Word has length 19 [2021-03-11 11:09:28,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:09:28,102 INFO L480 AbstractCegarLoop]: Abstraction has 830 states and 2517 transitions. [2021-03-11 11:09:28,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 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 11:09:28,102 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 2517 transitions. [2021-03-11 11:09:28,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-03-11 11:09:28,104 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:09:28,104 INFO L519 BasicCegarLoop]: trace histogram [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 11:09:28,104 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 11:09:28,104 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:09:28,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:09:28,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1077865599, now seen corresponding path program 1 times [2021-03-11 11:09:28,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:09:28,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651224805] [2021-03-11 11:09:28,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:09:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:09:28,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:28,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:09:28,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:28,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:09:28,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:28,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:09:28,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:28,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:09:28,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:28,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:09:28,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:28,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:09:28,178 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 11:09:28,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651224805] [2021-03-11 11:09:28,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:09:28,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 11:09:28,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802602120] [2021-03-11 11:09:28,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 11:09:28,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:09:28,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 11:09:28,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:09:28,179 INFO L87 Difference]: Start difference. First operand 830 states and 2517 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 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 11:09:28,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:09:28,234 INFO L93 Difference]: Finished difference Result 800 states and 2455 transitions. [2021-03-11 11:09:28,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 11:09:28,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-03-11 11:09:28,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:09:28,238 INFO L225 Difference]: With dead ends: 800 [2021-03-11 11:09:28,238 INFO L226 Difference]: Without dead ends: 781 [2021-03-11 11:09:28,238 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 23.3ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-03-11 11:09:28,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2021-03-11 11:09:28,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 685. [2021-03-11 11:09:28,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 684 states have (on average 3.115497076023392) internal successors, (2131), 684 states have internal predecessors, (2131), 0 states have call successors, (0), 0 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 11:09:28,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 2131 transitions. [2021-03-11 11:09:28,249 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 2131 transitions. Word has length 22 [2021-03-11 11:09:28,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:09:28,250 INFO L480 AbstractCegarLoop]: Abstraction has 685 states and 2131 transitions. [2021-03-11 11:09:28,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 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 11:09:28,250 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 2131 transitions. [2021-03-11 11:09:28,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-03-11 11:09:28,252 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:09:28,252 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:09:28,252 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 11:09:28,252 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:09:28,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:09:28,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1811857207, now seen corresponding path program 1 times [2021-03-11 11:09:28,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:09:28,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784322833] [2021-03-11 11:09:28,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:09:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:09:28,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:28,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:09:28,300 INFO L142 QuantifierPusher]: treesize reduction 4, result has 83.3 percent of original size [2021-03-11 11:09:28,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-11 11:09:28,310 INFO L142 QuantifierPusher]: treesize reduction 19, result has 13.6 percent of original size [2021-03-11 11:09:28,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:09:28,315 INFO L142 QuantifierPusher]: treesize reduction 10, result has 56.5 percent of original size [2021-03-11 11:09:28,316 INFO L147 QuantifierPusher]: treesize reduction 4, result has 69.2 percent of original size 9 [2021-03-11 11:09:28,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:28,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:09:28,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:09:28,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:09:28,337 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 11:09:28,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784322833] [2021-03-11 11:09:28,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:09:28,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 11:09:28,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438884868] [2021-03-11 11:09:28,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 11:09:28,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:09:28,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 11:09:28,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:09:28,342 INFO L87 Difference]: Start difference. First operand 685 states and 2131 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 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 11:09:28,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:09:28,485 INFO L93 Difference]: Finished difference Result 1188 states and 3526 transitions. [2021-03-11 11:09:28,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-11 11:09:28,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-03-11 11:09:28,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:09:28,488 INFO L225 Difference]: With dead ends: 1188 [2021-03-11 11:09:28,488 INFO L226 Difference]: Without dead ends: 512 [2021-03-11 11:09:28,488 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 70.5ms TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-03-11 11:09:28,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2021-03-11 11:09:28,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 429. [2021-03-11 11:09:28,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 2.810747663551402) internal successors, (1203), 428 states have internal predecessors, (1203), 0 states have call successors, (0), 0 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 11:09:28,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1203 transitions. [2021-03-11 11:09:28,495 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1203 transitions. Word has length 26 [2021-03-11 11:09:28,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:09:28,495 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 1203 transitions. [2021-03-11 11:09:28,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 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 11:09:28,495 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1203 transitions. [2021-03-11 11:09:28,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-03-11 11:09:28,496 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:09:28,496 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:09:28,496 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 11:09:28,496 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:09:28,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:09:28,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1278396873, now seen corresponding path program 2 times [2021-03-11 11:09:28,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:09:28,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539258834] [2021-03-11 11:09:28,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:09:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:09:28,588 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-11 11:09:28,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-11 11:09:28,608 INFO L142 QuantifierPusher]: treesize reduction 15, result has 78.9 percent of original size [2021-03-11 11:09:28,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-03-11 11:09:28,644 INFO L142 QuantifierPusher]: treesize reduction 21, result has 77.9 percent of original size [2021-03-11 11:09:28,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2021-03-11 11:09:28,727 INFO L142 QuantifierPusher]: treesize reduction 21, result has 79.4 percent of original size [2021-03-11 11:09:28,728 INFO L147 QuantifierPusher]: treesize reduction 4, result has 95.1 percent of original size 77 [2021-03-11 11:09:28,765 INFO L142 QuantifierPusher]: treesize reduction 11, result has 81.0 percent of original size [2021-03-11 11:09:28,766 INFO L147 QuantifierPusher]: treesize reduction 4, result has 91.5 percent of original size 43 [2021-03-11 11:09:28,801 INFO L142 QuantifierPusher]: treesize reduction 14, result has 74.5 percent of original size [2021-03-11 11:09:28,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-11 11:09:28,832 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 11:09:28,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539258834] [2021-03-11 11:09:28,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:09:28,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 11:09:28,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962486425] [2021-03-11 11:09:28,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 11:09:28,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:09:28,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 11:09:28,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-11 11:09:28,834 INFO L87 Difference]: Start difference. First operand 429 states and 1203 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 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 11:09:28,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:09:28,990 INFO L93 Difference]: Finished difference Result 562 states and 1528 transitions. [2021-03-11 11:09:28,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 11:09:28,991 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-03-11 11:09:28,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:09:28,993 INFO L225 Difference]: With dead ends: 562 [2021-03-11 11:09:28,993 INFO L226 Difference]: Without dead ends: 464 [2021-03-11 11:09:28,993 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 298.6ms TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-03-11 11:09:28,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-03-11 11:09:28,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 381. [2021-03-11 11:09:28,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 2.776315789473684) internal successors, (1055), 380 states have internal predecessors, (1055), 0 states have call successors, (0), 0 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 11:09:29,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1055 transitions. [2021-03-11 11:09:29,000 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1055 transitions. Word has length 26 [2021-03-11 11:09:29,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:09:29,000 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 1055 transitions. [2021-03-11 11:09:29,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 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 11:09:29,001 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1055 transitions. [2021-03-11 11:09:29,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-03-11 11:09:29,001 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:09:29,002 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:09:29,002 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 11:09:29,002 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:09:29,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:09:29,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1216104887, now seen corresponding path program 3 times [2021-03-11 11:09:29,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:09:29,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944911152] [2021-03-11 11:09:29,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:09:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 11:09:29,040 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 11:09:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 11:09:29,072 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 11:09:29,103 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 11:09:29,104 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 11:09:29,104 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 11:09:29,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 11:09:29 BasicIcfg [2021-03-11 11:09:29,192 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 11:09:29,192 INFO L168 Benchmark]: Toolchain (without parser) took 19786.84 ms. Allocated memory was 255.9 MB in the beginning and 662.7 MB in the end (delta: 406.8 MB). Free memory was 234.8 MB in the beginning and 522.8 MB in the end (delta: -288.0 MB). Peak memory consumption was 118.5 MB. Max. memory is 16.0 GB. [2021-03-11 11:09:29,193 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 255.9 MB. Free memory was 237.2 MB in the beginning and 237.1 MB in the end (delta: 93.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 11:09:29,193 INFO L168 Benchmark]: CACSL2BoogieTranslator took 449.06 ms. Allocated memory was 255.9 MB in the beginning and 352.3 MB in the end (delta: 96.5 MB). Free memory was 233.9 MB in the beginning and 312.3 MB in the end (delta: -78.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-11 11:09:29,193 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.82 ms. Allocated memory is still 352.3 MB. Free memory was 312.3 MB in the beginning and 309.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-11 11:09:29,193 INFO L168 Benchmark]: Boogie Preprocessor took 45.00 ms. Allocated memory is still 352.3 MB. Free memory was 309.7 MB in the beginning and 307.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 11:09:29,194 INFO L168 Benchmark]: RCFGBuilder took 1240.30 ms. Allocated memory is still 352.3 MB. Free memory was 307.1 MB in the beginning and 230.8 MB in the end (delta: 76.2 MB). Peak memory consumption was 78.3 MB. Max. memory is 16.0 GB. [2021-03-11 11:09:29,194 INFO L168 Benchmark]: TraceAbstraction took 17988.94 ms. Allocated memory was 352.3 MB in the beginning and 662.7 MB in the end (delta: 310.4 MB). Free memory was 229.8 MB in the beginning and 522.8 MB in the end (delta: -293.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 16.0 GB. [2021-03-11 11:09:29,195 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 255.9 MB. Free memory was 237.2 MB in the beginning and 237.1 MB in the end (delta: 93.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 449.06 ms. Allocated memory was 255.9 MB in the beginning and 352.3 MB in the end (delta: 96.5 MB). Free memory was 233.9 MB in the beginning and 312.3 MB in the end (delta: -78.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 55.82 ms. Allocated memory is still 352.3 MB. Free memory was 312.3 MB in the beginning and 309.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 45.00 ms. Allocated memory is still 352.3 MB. Free memory was 309.7 MB in the beginning and 307.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1240.30 ms. Allocated memory is still 352.3 MB. Free memory was 307.1 MB in the beginning and 230.8 MB in the end (delta: 76.2 MB). Peak memory consumption was 78.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 17988.94 ms. Allocated memory was 352.3 MB in the beginning and 662.7 MB in the end (delta: 310.4 MB). Free memory was 229.8 MB in the beginning and 522.8 MB in the end (delta: -293.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14957.3ms, 129 PlacesBefore, 45 PlacesAfterwards, 118 TransitionsBefore, 33 TransitionsAfterwards, 2598 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 99 TotalNumberOfCompositions, 6938 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3519, positive: 3311, positive conditional: 0, positive unconditional: 3311, negative: 208, negative conditional: 0, negative unconditional: 208, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1762, positive: 1704, positive conditional: 0, positive unconditional: 1704, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1762, positive: 1674, positive conditional: 0, positive unconditional: 1674, negative: 88, negative conditional: 0, negative unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 88, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 851, positive: 81, positive conditional: 0, positive unconditional: 81, negative: 771, negative conditional: 0, negative unconditional: 771, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3519, positive: 1607, positive conditional: 0, positive unconditional: 1607, negative: 150, negative conditional: 0, negative unconditional: 150, unknown: 1762, unknown conditional: 0, unknown unconditional: 1762] , Statistics on independence cache: Total cache size (in pairs): 187, Positive cache size: 164, Positive conditional cache size: 0, Positive unconditional cache size: 164, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1133; [L849] FCALL, FORK 0 pthread_create(&t1133, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1134; [L851] FCALL, FORK 0 pthread_create(&t1134, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1135; [L853] FCALL, FORK 0 pthread_create(&t1135, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 pthread_t t1136; [L855] FCALL, FORK 0 pthread_create(&t1136, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] 4 z$w_buff1 = z$w_buff0 [L805] 4 z$w_buff0 = 2 [L806] 4 z$w_buff1_used = z$w_buff0_used [L807] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L809] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 a = 1 [L820] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L784] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L826] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L827] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L828] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L829] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L829] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L830] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L830] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 4 return 0; [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L790] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L790] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L791] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L792] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L793] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L793] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L794] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L861] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L861] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L862] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L863] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L864] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L864] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L865] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L865] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 z$flush_delayed = weak$$choice2 [L871] 0 z$mem_tmp = z [L872] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L872] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L873] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L873] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L873] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L874] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L874] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L875] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L875] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L875] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L875] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L876] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L877] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L877] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L877] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L878] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L878] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L880] 0 z = z$flush_delayed ? z$mem_tmp : z [L881] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 117 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17831.6ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 29.5ms, AutomataDifference: 825.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 15093.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 318 SDtfs, 515 SDslu, 778 SDs, 0 SdLazy, 321 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 291.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 552.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3002occurred in iteration=0, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 385.5ms AutomataMinimizationTime, 10 MinimizatonAttempts, 358 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 33.3ms SsaConstructionTime, 409.7ms SatisfiabilityAnalysisTime, 819.5ms InterpolantComputationTime, 196 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 1350 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...