/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9e34d99ae2c6837f487980c721c4b6acf9d9b15c-9e34d99 [2021-07-09 16:45:43,344 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-09 16:45:43,346 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-09 16:45:43,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-09 16:45:43,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-09 16:45:43,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-09 16:45:43,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-09 16:45:43,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-09 16:45:43,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-09 16:45:43,396 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-09 16:45:43,397 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-09 16:45:43,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-09 16:45:43,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-09 16:45:43,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-09 16:45:43,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-09 16:45:43,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-09 16:45:43,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-09 16:45:43,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-09 16:45:43,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-09 16:45:43,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-09 16:45:43,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-09 16:45:43,418 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-09 16:45:43,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-09 16:45:43,420 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-09 16:45:43,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-09 16:45:43,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-09 16:45:43,425 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-09 16:45:43,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-09 16:45:43,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-09 16:45:43,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-09 16:45:43,426 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-09 16:45:43,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-09 16:45:43,427 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-09 16:45:43,428 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-09 16:45:43,428 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-09 16:45:43,428 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-09 16:45:43,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-09 16:45:43,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-09 16:45:43,429 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-09 16:45:43,430 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-09 16:45:43,430 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-09 16:45:43,431 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-NoLbe.epf [2021-07-09 16:45:43,450 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-09 16:45:43,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-09 16:45:43,451 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-07-09 16:45:43,451 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-07-09 16:45:43,453 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-09 16:45:43,453 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-09 16:45:43,453 INFO L138 SettingsManager]: * Use SBE=true [2021-07-09 16:45:43,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-09 16:45:43,453 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-09 16:45:43,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-09 16:45:43,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-09 16:45:43,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-09 16:45:43,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-09 16:45:43,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-09 16:45:43,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-09 16:45:43,455 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-09 16:45:43,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-09 16:45:43,455 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-09 16:45:43,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-09 16:45:43,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-09 16:45:43,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-09 16:45:43,455 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-09 16:45:43,455 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-09 16:45:43,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-09 16:45:43,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-09 16:45:43,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-09 16:45:43,456 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-09 16:45:43,456 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-09 16:45:43,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-09 16:45:43,456 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-09 16:45:43,456 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-09 16:45:43,457 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-07-09 16:45:43,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-09 16:45:43,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-09 16:45:43,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-09 16:45:43,728 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-09 16:45:43,728 INFO L275 PluginConnector]: CDTParser initialized [2021-07-09 16:45:43,728 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_rmo.opt.i [2021-07-09 16:45:43,780 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74f349eea/3d14bfa0a3124e8099bcb6435ea5a3c6/FLAGfa006e966 [2021-07-09 16:45:44,264 INFO L306 CDTParser]: Found 1 translation units. [2021-07-09 16:45:44,264 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_rmo.opt.i [2021-07-09 16:45:44,276 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74f349eea/3d14bfa0a3124e8099bcb6435ea5a3c6/FLAGfa006e966 [2021-07-09 16:45:44,286 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74f349eea/3d14bfa0a3124e8099bcb6435ea5a3c6 [2021-07-09 16:45:44,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-09 16:45:44,289 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-09 16:45:44,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-09 16:45:44,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-09 16:45:44,295 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-09 16:45:44,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 04:45:44" (1/1) ... [2021-07-09 16:45:44,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@690dff55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:45:44, skipping insertion in model container [2021-07-09 16:45:44,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 04:45:44" (1/1) ... [2021-07-09 16:45:44,300 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-09 16:45:44,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-09 16:45:44,436 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_rmo.opt.i[948,961] [2021-07-09 16:45:44,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 16:45:44,656 INFO L203 MainTranslator]: Completed pre-run [2021-07-09 16:45:44,665 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_rmo.opt.i[948,961] [2021-07-09 16:45:44,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 16:45:44,738 INFO L208 MainTranslator]: Completed translation [2021-07-09 16:45:44,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:45:44 WrapperNode [2021-07-09 16:45:44,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-09 16:45:44,740 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-09 16:45:44,740 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-09 16:45:44,740 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-09 16:45:44,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:45:44" (1/1) ... [2021-07-09 16:45:44,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:45:44" (1/1) ... [2021-07-09 16:45:44,775 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-09 16:45:44,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-09 16:45:44,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-09 16:45:44,776 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-09 16:45:44,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:45:44" (1/1) ... [2021-07-09 16:45:44,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:45:44" (1/1) ... [2021-07-09 16:45:44,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:45:44" (1/1) ... [2021-07-09 16:45:44,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:45:44" (1/1) ... [2021-07-09 16:45:44,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:45:44" (1/1) ... [2021-07-09 16:45:44,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:45:44" (1/1) ... [2021-07-09 16:45:44,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:45:44" (1/1) ... [2021-07-09 16:45:44,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-09 16:45:44,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-09 16:45:44,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-09 16:45:44,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-09 16:45:44,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:45:44" (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-07-09 16:45:44,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-09 16:45:44,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-07-09 16:45:44,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-09 16:45:44,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-09 16:45:44,902 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-07-09 16:45:44,904 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-07-09 16:45:44,904 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-07-09 16:45:44,904 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-07-09 16:45:44,904 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-07-09 16:45:44,904 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-07-09 16:45:44,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-09 16:45:44,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-07-09 16:45:44,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-09 16:45:44,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-09 16:45:44,905 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-09 16:45:46,236 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-09 16:45:46,236 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-07-09 16:45:46,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 04:45:46 BoogieIcfgContainer [2021-07-09 16:45:46,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-09 16:45:46,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-09 16:45:46,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-09 16:45:46,241 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-09 16:45:46,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.07 04:45:44" (1/3) ... [2021-07-09 16:45:46,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b251de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 04:45:46, skipping insertion in model container [2021-07-09 16:45:46,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:45:44" (2/3) ... [2021-07-09 16:45:46,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b251de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 04:45:46, skipping insertion in model container [2021-07-09 16:45:46,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 04:45:46" (3/3) ... [2021-07-09 16:45:46,243 INFO L111 eAbstractionObserver]: Analyzing ICFG mix056_rmo.opt.i [2021-07-09 16:45:46,248 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-09 16:45:46,248 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-09 16:45:46,248 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-09 16:45:46,248 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-09 16:45:46,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,271 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,271 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,271 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,271 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,272 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,272 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,273 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,273 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,275 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,276 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,276 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,276 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,276 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,276 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,277 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,277 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,281 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,282 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,282 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,282 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,282 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,282 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,284 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,284 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,285 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,285 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:45:46,287 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-07-09 16:45:46,305 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-09 16:45:46,317 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 16:45:46,317 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 16:45:46,318 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 16:45:46,318 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 16:45:46,318 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 16:45:46,318 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 16:45:46,318 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 16:45:46,318 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P2Thread1of1ForFork0======== [2021-07-09 16:45:46,329 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 105 transitions, 225 flow [2021-07-09 16:45:46,471 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5016 states, 5014 states have (on average 3.347826086956522) internal successors, (16786), 5015 states have internal predecessors, (16786), 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-07-09 16:45:46,489 INFO L276 IsEmpty]: Start isEmpty. Operand has 5016 states, 5014 states have (on average 3.347826086956522) internal successors, (16786), 5015 states have internal predecessors, (16786), 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-07-09 16:45:46,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-07-09 16:45:46,508 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:45:46,508 INFO L508 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, 1, 1, 1, 1, 1, 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-07-09 16:45:46,509 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:45:46,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:45:46,516 INFO L82 PathProgramCache]: Analyzing trace with hash -403253400, now seen corresponding path program 1 times [2021-07-09 16:45:46,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:45:46,522 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540697226] [2021-07-09 16:45:46,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:45:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:45:46,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:45:46,766 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:45:46,766 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540697226] [2021-07-09 16:45:46,767 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540697226] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:45:46,768 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:45:46,768 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-09 16:45:46,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481538965] [2021-07-09 16:45:46,771 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-09 16:45:46,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:45:46,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-09 16:45:46,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-09 16:45:46,812 INFO L87 Difference]: Start difference. First operand has 5016 states, 5014 states have (on average 3.347826086956522) internal successors, (16786), 5015 states have internal predecessors, (16786), 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 27.5) internal successors, (55), 3 states have internal predecessors, (55), 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-07-09 16:45:46,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:45:46,882 INFO L93 Difference]: Finished difference Result 3392 states and 10501 transitions. [2021-07-09 16:45:46,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-09 16:45:46,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 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 55 [2021-07-09 16:45:46,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:45:46,887 INFO L225 Difference]: With dead ends: 3392 [2021-07-09 16:45:46,887 INFO L226 Difference]: Without dead ends: 0 [2021-07-09 16:45:46,888 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-09 16:45:46,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-09 16:45:46,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-09 16:45:46,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-07-09 16:45:46,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-09 16:45:46,903 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2021-07-09 16:45:46,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:45:46,904 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-09 16:45:46,908 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 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-07-09 16:45:46,908 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-09 16:45:46,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-09 16:45:46,909 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-09 16:45:46,909 INFO L301 ceAbstractionStarter]: Result for error location P2Thread1of1ForFork0 was SAFE (1/2) [2021-07-09 16:45:46,910 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-07-09 16:45:46,911 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 16:45:46,911 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 16:45:46,911 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 16:45:46,911 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 16:45:46,911 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 16:45:46,911 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 16:45:46,911 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 16:45:46,911 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-09 16:45:46,913 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 105 transitions, 225 flow [2021-07-09 16:45:47,079 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 8544 states, 8542 states have (on average 3.5590025755092483) internal successors, (30401), 8543 states have internal predecessors, (30401), 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-07-09 16:45:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 8544 states, 8542 states have (on average 3.5590025755092483) internal successors, (30401), 8543 states have internal predecessors, (30401), 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-07-09 16:45:47,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-07-09 16:45:47,121 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:45:47,121 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-09 16:45:47,121 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:45:47,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:45:47,122 INFO L82 PathProgramCache]: Analyzing trace with hash 377873787, now seen corresponding path program 1 times [2021-07-09 16:45:47,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:45:47,122 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137801927] [2021-07-09 16:45:47,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:45:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:45:47,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-07-09 16:45:47,338 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:45:47,338 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137801927] [2021-07-09 16:45:47,339 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137801927] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:45:47,339 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:45:47,339 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:45:47,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252909405] [2021-07-09 16:45:47,340 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:45:47,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:45:47,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:45:47,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:45:47,356 INFO L87 Difference]: Start difference. First operand has 8544 states, 8542 states have (on average 3.5590025755092483) internal successors, (30401), 8543 states have internal predecessors, (30401), 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 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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-07-09 16:45:47,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:45:47,566 INFO L93 Difference]: Finished difference Result 10236 states and 35487 transitions. [2021-07-09 16:45:47,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:45:47,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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 67 [2021-07-09 16:45:47,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:45:47,679 INFO L225 Difference]: With dead ends: 10236 [2021-07-09 16:45:47,679 INFO L226 Difference]: Without dead ends: 7716 [2021-07-09 16:45:47,680 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 76.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:45:47,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7716 states. [2021-07-09 16:45:47,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7716 to 7716. [2021-07-09 16:45:47,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7716 states, 7714 states have (on average 3.475758361420793) internal successors, (26812), 7715 states have internal predecessors, (26812), 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-07-09 16:45:47,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7716 states to 7716 states and 26812 transitions. [2021-07-09 16:45:47,963 INFO L78 Accepts]: Start accepts. Automaton has 7716 states and 26812 transitions. Word has length 67 [2021-07-09 16:45:47,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:45:47,964 INFO L482 AbstractCegarLoop]: Abstraction has 7716 states and 26812 transitions. [2021-07-09 16:45:47,964 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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-07-09 16:45:47,964 INFO L276 IsEmpty]: Start isEmpty. Operand 7716 states and 26812 transitions. [2021-07-09 16:45:47,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-07-09 16:45:47,976 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:45:47,977 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-09 16:45:47,977 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-09 16:45:47,977 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:45:47,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:45:47,978 INFO L82 PathProgramCache]: Analyzing trace with hash 638175152, now seen corresponding path program 1 times [2021-07-09 16:45:47,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:45:47,978 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820242201] [2021-07-09 16:45:47,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:45:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:45:48,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:45:48,261 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:45:48,261 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820242201] [2021-07-09 16:45:48,261 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820242201] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:45:48,261 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:45:48,261 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-09 16:45:48,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281244516] [2021-07-09 16:45:48,262 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-09 16:45:48,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:45:48,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-09 16:45:48,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-07-09 16:45:48,265 INFO L87 Difference]: Start difference. First operand 7716 states and 26812 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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-07-09 16:45:48,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:45:48,587 INFO L93 Difference]: Finished difference Result 9039 states and 31055 transitions. [2021-07-09 16:45:48,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-07-09 16:45:48,593 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2021-07-09 16:45:48,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:45:48,658 INFO L225 Difference]: With dead ends: 9039 [2021-07-09 16:45:48,658 INFO L226 Difference]: Without dead ends: 7299 [2021-07-09 16:45:48,659 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 222.0ms TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2021-07-09 16:45:48,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7299 states. [2021-07-09 16:45:48,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7299 to 7257. [2021-07-09 16:45:48,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7257 states, 7255 states have (on average 3.4566505858028944) internal successors, (25078), 7256 states have internal predecessors, (25078), 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-07-09 16:45:48,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7257 states to 7257 states and 25078 transitions. [2021-07-09 16:45:48,897 INFO L78 Accepts]: Start accepts. Automaton has 7257 states and 25078 transitions. Word has length 69 [2021-07-09 16:45:48,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:45:48,898 INFO L482 AbstractCegarLoop]: Abstraction has 7257 states and 25078 transitions. [2021-07-09 16:45:48,898 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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-07-09 16:45:48,898 INFO L276 IsEmpty]: Start isEmpty. Operand 7257 states and 25078 transitions. [2021-07-09 16:45:48,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-07-09 16:45:48,912 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:45:48,912 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-09 16:45:48,912 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-09 16:45:48,913 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:45:48,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:45:48,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1343876754, now seen corresponding path program 1 times [2021-07-09 16:45:48,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:45:48,915 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416452488] [2021-07-09 16:45:48,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:45:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:45:49,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:45:49,107 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:45:49,108 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416452488] [2021-07-09 16:45:49,108 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416452488] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:45:49,108 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:45:49,108 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-09 16:45:49,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825460266] [2021-07-09 16:45:49,112 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-09 16:45:49,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:45:49,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-09 16:45:49,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-07-09 16:45:49,113 INFO L87 Difference]: Start difference. First operand 7257 states and 25078 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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-07-09 16:45:49,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:45:49,440 INFO L93 Difference]: Finished difference Result 8923 states and 30629 transitions. [2021-07-09 16:45:49,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-09 16:45:49,441 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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 70 [2021-07-09 16:45:49,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:45:49,467 INFO L225 Difference]: With dead ends: 8923 [2021-07-09 16:45:49,467 INFO L226 Difference]: Without dead ends: 7551 [2021-07-09 16:45:49,468 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 185.5ms TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2021-07-09 16:45:49,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7551 states. [2021-07-09 16:45:49,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7551 to 7383. [2021-07-09 16:45:49,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7383 states, 7381 states have (on average 3.449261617666983) internal successors, (25459), 7382 states have internal predecessors, (25459), 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-07-09 16:45:49,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7383 states to 7383 states and 25459 transitions. [2021-07-09 16:45:49,756 INFO L78 Accepts]: Start accepts. Automaton has 7383 states and 25459 transitions. Word has length 70 [2021-07-09 16:45:49,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:45:49,756 INFO L482 AbstractCegarLoop]: Abstraction has 7383 states and 25459 transitions. [2021-07-09 16:45:49,756 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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-07-09 16:45:49,756 INFO L276 IsEmpty]: Start isEmpty. Operand 7383 states and 25459 transitions. [2021-07-09 16:45:49,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-07-09 16:45:49,768 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:45:49,769 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-09 16:45:49,769 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-09 16:45:49,769 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:45:49,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:45:49,769 INFO L82 PathProgramCache]: Analyzing trace with hash -2113436594, now seen corresponding path program 1 times [2021-07-09 16:45:49,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:45:49,770 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178123257] [2021-07-09 16:45:49,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:45:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:45:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:45:49,935 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:45:49,935 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178123257] [2021-07-09 16:45:49,936 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178123257] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:45:49,936 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:45:49,936 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-09 16:45:49,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381195129] [2021-07-09 16:45:49,936 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-09 16:45:49,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:45:49,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-09 16:45:49,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-07-09 16:45:49,938 INFO L87 Difference]: Start difference. First operand 7383 states and 25459 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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-07-09 16:45:50,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:45:50,405 INFO L93 Difference]: Finished difference Result 8751 states and 30021 transitions. [2021-07-09 16:45:50,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-07-09 16:45:50,414 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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 71 [2021-07-09 16:45:50,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:45:50,445 INFO L225 Difference]: With dead ends: 8751 [2021-07-09 16:45:50,445 INFO L226 Difference]: Without dead ends: 7551 [2021-07-09 16:45:50,445 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 250.0ms TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2021-07-09 16:45:50,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7551 states. [2021-07-09 16:45:50,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7551 to 7425. [2021-07-09 16:45:50,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7425 states, 7423 states have (on average 3.445911356594369) internal successors, (25579), 7424 states have internal predecessors, (25579), 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-07-09 16:45:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7425 states to 7425 states and 25579 transitions. [2021-07-09 16:45:50,646 INFO L78 Accepts]: Start accepts. Automaton has 7425 states and 25579 transitions. Word has length 71 [2021-07-09 16:45:50,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:45:50,647 INFO L482 AbstractCegarLoop]: Abstraction has 7425 states and 25579 transitions. [2021-07-09 16:45:50,647 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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-07-09 16:45:50,647 INFO L276 IsEmpty]: Start isEmpty. Operand 7425 states and 25579 transitions. [2021-07-09 16:45:50,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-07-09 16:45:50,659 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:45:50,659 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-09 16:45:50,659 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-09 16:45:50,659 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:45:50,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:45:50,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1044701454, now seen corresponding path program 2 times [2021-07-09 16:45:50,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:45:50,666 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986635248] [2021-07-09 16:45:50,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:45:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:45:50,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:45:50,875 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:45:50,876 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986635248] [2021-07-09 16:45:50,876 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986635248] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:45:50,876 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:45:50,876 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-09 16:45:50,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031925680] [2021-07-09 16:45:50,876 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-09 16:45:50,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:45:50,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-09 16:45:50,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:45:50,877 INFO L87 Difference]: Start difference. First operand 7425 states and 25579 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 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-07-09 16:45:51,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:45:51,288 INFO L93 Difference]: Finished difference Result 8361 states and 28555 transitions. [2021-07-09 16:45:51,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-09 16:45:51,289 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 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 71 [2021-07-09 16:45:51,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:45:51,317 INFO L225 Difference]: With dead ends: 8361 [2021-07-09 16:45:51,318 INFO L226 Difference]: Without dead ends: 7161 [2021-07-09 16:45:51,318 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 311.3ms TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-07-09 16:45:51,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7161 states. [2021-07-09 16:45:51,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7161 to 7119. [2021-07-09 16:45:51,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7119 states, 7117 states have (on average 3.4375439089504005) internal successors, (24465), 7118 states have internal predecessors, (24465), 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-07-09 16:45:51,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7119 states to 7119 states and 24465 transitions. [2021-07-09 16:45:51,481 INFO L78 Accepts]: Start accepts. Automaton has 7119 states and 24465 transitions. Word has length 71 [2021-07-09 16:45:51,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:45:51,481 INFO L482 AbstractCegarLoop]: Abstraction has 7119 states and 24465 transitions. [2021-07-09 16:45:51,481 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 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-07-09 16:45:51,482 INFO L276 IsEmpty]: Start isEmpty. Operand 7119 states and 24465 transitions. [2021-07-09 16:45:51,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-07-09 16:45:51,541 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:45:51,541 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-09 16:45:51,541 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-09 16:45:51,542 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:45:51,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:45:51,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1770440015, now seen corresponding path program 1 times [2021-07-09 16:45:51,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:45:51,542 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207483440] [2021-07-09 16:45:51,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:45:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:45:51,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:45:51,689 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:45:51,689 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207483440] [2021-07-09 16:45:51,689 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207483440] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:45:51,690 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:45:51,690 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-09 16:45:51,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617736512] [2021-07-09 16:45:51,690 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-09 16:45:51,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:45:51,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-09 16:45:51,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-07-09 16:45:51,691 INFO L87 Difference]: Start difference. First operand 7119 states and 24465 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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-07-09 16:45:51,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:45:51,919 INFO L93 Difference]: Finished difference Result 7602 states and 25880 transitions. [2021-07-09 16:45:51,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-09 16:45:51,920 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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 71 [2021-07-09 16:45:51,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:45:51,940 INFO L225 Difference]: With dead ends: 7602 [2021-07-09 16:45:51,940 INFO L226 Difference]: Without dead ends: 6706 [2021-07-09 16:45:51,940 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 145.5ms TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2021-07-09 16:45:51,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6706 states. [2021-07-09 16:45:52,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6706 to 6706. [2021-07-09 16:45:52,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6706 states, 6705 states have (on average 3.419537658463833) internal successors, (22928), 6705 states have internal predecessors, (22928), 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-07-09 16:45:52,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6706 states to 6706 states and 22928 transitions. [2021-07-09 16:45:52,106 INFO L78 Accepts]: Start accepts. Automaton has 6706 states and 22928 transitions. Word has length 71 [2021-07-09 16:45:52,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:45:52,107 INFO L482 AbstractCegarLoop]: Abstraction has 6706 states and 22928 transitions. [2021-07-09 16:45:52,107 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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-07-09 16:45:52,107 INFO L276 IsEmpty]: Start isEmpty. Operand 6706 states and 22928 transitions. [2021-07-09 16:45:52,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-07-09 16:45:52,117 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:45:52,118 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-09 16:45:52,118 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-09 16:45:52,118 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:45:52,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:45:52,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1423944631, now seen corresponding path program 2 times [2021-07-09 16:45:52,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:45:52,119 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433551175] [2021-07-09 16:45:52,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:45:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:45:52,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-07-09 16:45:52,337 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:45:52,339 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433551175] [2021-07-09 16:45:52,339 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433551175] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:45:52,339 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:45:52,339 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-09 16:45:52,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828626625] [2021-07-09 16:45:52,340 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-09 16:45:52,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:45:52,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-09 16:45:52,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-07-09 16:45:52,341 INFO L87 Difference]: Start difference. First operand 6706 states and 22928 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 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-07-09 16:45:52,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:45:52,569 INFO L93 Difference]: Finished difference Result 7266 states and 24668 transitions. [2021-07-09 16:45:52,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-09 16:45:52,570 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 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 71 [2021-07-09 16:45:52,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:45:52,585 INFO L225 Difference]: With dead ends: 7266 [2021-07-09 16:45:52,586 INFO L226 Difference]: Without dead ends: 6370 [2021-07-09 16:45:52,586 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 187.2ms TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2021-07-09 16:45:52,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6370 states. [2021-07-09 16:45:52,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6370 to 6300. [2021-07-09 16:45:52,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6300 states, 6299 states have (on average 3.418002857596444) internal successors, (21530), 6299 states have internal predecessors, (21530), 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-07-09 16:45:52,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6300 states to 6300 states and 21530 transitions. [2021-07-09 16:45:52,724 INFO L78 Accepts]: Start accepts. Automaton has 6300 states and 21530 transitions. Word has length 71 [2021-07-09 16:45:52,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:45:52,724 INFO L482 AbstractCegarLoop]: Abstraction has 6300 states and 21530 transitions. [2021-07-09 16:45:52,724 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 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-07-09 16:45:52,724 INFO L276 IsEmpty]: Start isEmpty. Operand 6300 states and 21530 transitions. [2021-07-09 16:45:52,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-07-09 16:45:52,735 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:45:52,735 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-09 16:45:52,735 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-09 16:45:52,735 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:45:52,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:45:52,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1660092499, now seen corresponding path program 1 times [2021-07-09 16:45:52,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:45:52,736 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751262463] [2021-07-09 16:45:52,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:45:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:45:52,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:45:52,824 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:45:52,824 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751262463] [2021-07-09 16:45:52,824 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751262463] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:45:52,824 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:45:52,824 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:45:52,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217864338] [2021-07-09 16:45:52,824 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:45:52,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:45:52,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:45:52,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:45:52,825 INFO L87 Difference]: Start difference. First operand 6300 states and 21530 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-07-09 16:45:52,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:45:52,934 INFO L93 Difference]: Finished difference Result 7448 states and 25002 transitions. [2021-07-09 16:45:52,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:45:52,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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 73 [2021-07-09 16:45:52,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:45:52,948 INFO L225 Difference]: With dead ends: 7448 [2021-07-09 16:45:52,948 INFO L226 Difference]: Without dead ends: 5544 [2021-07-09 16:45:52,949 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 81.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:45:52,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5544 states. [2021-07-09 16:45:53,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5544 to 5544. [2021-07-09 16:45:53,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5544 states, 5543 states have (on average 3.3386252931625475) internal successors, (18506), 5543 states have internal predecessors, (18506), 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-07-09 16:45:53,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 18506 transitions. [2021-07-09 16:45:53,102 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 18506 transitions. Word has length 73 [2021-07-09 16:45:53,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:45:53,102 INFO L482 AbstractCegarLoop]: Abstraction has 5544 states and 18506 transitions. [2021-07-09 16:45:53,102 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-07-09 16:45:53,102 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 18506 transitions. [2021-07-09 16:45:53,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-07-09 16:45:53,111 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:45:53,111 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-09 16:45:53,111 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-09 16:45:53,111 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:45:53,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:45:53,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2138580727, now seen corresponding path program 1 times [2021-07-09 16:45:53,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:45:53,112 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578969013] [2021-07-09 16:45:53,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:45:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:45:53,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:45:53,183 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:45:53,183 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578969013] [2021-07-09 16:45:53,183 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578969013] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:45:53,183 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:45:53,183 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 16:45:53,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394860145] [2021-07-09 16:45:53,184 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 16:45:53,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:45:53,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 16:45:53,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-09 16:45:53,184 INFO L87 Difference]: Start difference. First operand 5544 states and 18506 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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-07-09 16:45:53,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:45:53,296 INFO L93 Difference]: Finished difference Result 5178 states and 16750 transitions. [2021-07-09 16:45:53,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-09 16:45:53,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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 74 [2021-07-09 16:45:53,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:45:53,304 INFO L225 Difference]: With dead ends: 5178 [2021-07-09 16:45:53,304 INFO L226 Difference]: Without dead ends: 3690 [2021-07-09 16:45:53,304 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 79.6ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-07-09 16:45:53,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3690 states. [2021-07-09 16:45:53,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3690 to 3690. [2021-07-09 16:45:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3690 states, 3689 states have (on average 3.1737598265112497) internal successors, (11708), 3689 states have internal predecessors, (11708), 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-07-09 16:45:53,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3690 states and 11708 transitions. [2021-07-09 16:45:53,372 INFO L78 Accepts]: Start accepts. Automaton has 3690 states and 11708 transitions. Word has length 74 [2021-07-09 16:45:53,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:45:53,372 INFO L482 AbstractCegarLoop]: Abstraction has 3690 states and 11708 transitions. [2021-07-09 16:45:53,372 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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-07-09 16:45:53,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3690 states and 11708 transitions. [2021-07-09 16:45:53,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-09 16:45:53,378 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:45:53,378 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-09 16:45:53,378 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-09 16:45:53,378 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:45:53,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:45:53,379 INFO L82 PathProgramCache]: Analyzing trace with hash 734411502, now seen corresponding path program 1 times [2021-07-09 16:45:53,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:45:53,379 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149074699] [2021-07-09 16:45:53,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:45:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:45:53,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-07-09 16:45:53,440 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:45:53,440 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149074699] [2021-07-09 16:45:53,440 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149074699] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:45:53,440 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:45:53,440 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:45:53,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159293390] [2021-07-09 16:45:53,441 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:45:53,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:45:53,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:45:53,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:45:53,441 INFO L87 Difference]: Start difference. First operand 3690 states and 11708 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-07-09 16:45:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:45:53,534 INFO L93 Difference]: Finished difference Result 5940 states and 18684 transitions. [2021-07-09 16:45:53,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:45:53,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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 76 [2021-07-09 16:45:53,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:45:53,542 INFO L225 Difference]: With dead ends: 5940 [2021-07-09 16:45:53,542 INFO L226 Difference]: Without dead ends: 3798 [2021-07-09 16:45:53,542 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 66.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:45:53,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3798 states. [2021-07-09 16:45:53,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3798 to 3546. [2021-07-09 16:45:53,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3546 states, 3545 states have (on average 3.098730606488011) internal successors, (10985), 3545 states have internal predecessors, (10985), 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-07-09 16:45:53,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3546 states to 3546 states and 10985 transitions. [2021-07-09 16:45:53,612 INFO L78 Accepts]: Start accepts. Automaton has 3546 states and 10985 transitions. Word has length 76 [2021-07-09 16:45:53,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:45:53,612 INFO L482 AbstractCegarLoop]: Abstraction has 3546 states and 10985 transitions. [2021-07-09 16:45:53,612 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-07-09 16:45:53,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3546 states and 10985 transitions. [2021-07-09 16:45:53,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-07-09 16:45:53,618 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:45:53,618 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-09 16:45:53,618 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-07-09 16:45:53,619 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:45:53,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:45:53,619 INFO L82 PathProgramCache]: Analyzing trace with hash 700654180, now seen corresponding path program 1 times [2021-07-09 16:45:53,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:45:53,619 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154363808] [2021-07-09 16:45:53,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:45:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:45:53,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:45:53,795 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:45:53,795 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154363808] [2021-07-09 16:45:53,795 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154363808] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:45:53,796 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:45:53,796 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-09 16:45:53,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226349554] [2021-07-09 16:45:53,796 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-09 16:45:53,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:45:53,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-09 16:45:53,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:45:53,797 INFO L87 Difference]: Start difference. First operand 3546 states and 10985 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 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-07-09 16:45:54,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:45:54,041 INFO L93 Difference]: Finished difference Result 5532 states and 17097 transitions. [2021-07-09 16:45:54,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-09 16:45:54,042 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 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 77 [2021-07-09 16:45:54,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:45:54,049 INFO L225 Difference]: With dead ends: 5532 [2021-07-09 16:45:54,050 INFO L226 Difference]: Without dead ends: 3996 [2021-07-09 16:45:54,050 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 178.4ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-07-09 16:45:54,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3996 states. [2021-07-09 16:45:54,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3996 to 3636. [2021-07-09 16:45:54,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3636 states, 3635 states have (on average 3.064924346629986) internal successors, (11141), 3635 states have internal predecessors, (11141), 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-07-09 16:45:54,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 3636 states and 11141 transitions. [2021-07-09 16:45:54,126 INFO L78 Accepts]: Start accepts. Automaton has 3636 states and 11141 transitions. Word has length 77 [2021-07-09 16:45:54,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:45:54,126 INFO L482 AbstractCegarLoop]: Abstraction has 3636 states and 11141 transitions. [2021-07-09 16:45:54,126 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 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-07-09 16:45:54,126 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 11141 transitions. [2021-07-09 16:45:54,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-07-09 16:45:54,133 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:45:54,133 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-09 16:45:54,133 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-07-09 16:45:54,133 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:45:54,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:45:54,133 INFO L82 PathProgramCache]: Analyzing trace with hash -652013722, now seen corresponding path program 2 times [2021-07-09 16:45:54,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:45:54,134 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556908541] [2021-07-09 16:45:54,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:45:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:45:54,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:45:54,216 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:45:54,216 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556908541] [2021-07-09 16:45:54,216 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556908541] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:45:54,217 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:45:54,217 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-09 16:45:54,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027799337] [2021-07-09 16:45:54,217 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-09 16:45:54,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:45:54,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-09 16:45:54,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-07-09 16:45:54,218 INFO L87 Difference]: Start difference. First operand 3636 states and 11141 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-07-09 16:45:54,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:45:54,342 INFO L93 Difference]: Finished difference Result 2916 states and 8714 transitions. [2021-07-09 16:45:54,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-09 16:45:54,343 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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 77 [2021-07-09 16:45:54,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:45:54,345 INFO L225 Difference]: With dead ends: 2916 [2021-07-09 16:45:54,346 INFO L226 Difference]: Without dead ends: 1494 [2021-07-09 16:45:54,346 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 87.8ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-07-09 16:45:54,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2021-07-09 16:45:54,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1374. [2021-07-09 16:45:54,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1373 states have (on average 2.8732702112163144) internal successors, (3945), 1373 states have internal predecessors, (3945), 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-07-09 16:45:54,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 3945 transitions. [2021-07-09 16:45:54,368 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 3945 transitions. Word has length 77 [2021-07-09 16:45:54,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:45:54,368 INFO L482 AbstractCegarLoop]: Abstraction has 1374 states and 3945 transitions. [2021-07-09 16:45:54,368 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-07-09 16:45:54,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 3945 transitions. [2021-07-09 16:45:54,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-07-09 16:45:54,371 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:45:54,371 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-09 16:45:54,371 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-07-09 16:45:54,371 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:45:54,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:45:54,372 INFO L82 PathProgramCache]: Analyzing trace with hash 502426728, now seen corresponding path program 1 times [2021-07-09 16:45:54,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:45:54,372 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235187589] [2021-07-09 16:45:54,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:45:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:45:54,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:45:54,453 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:45:54,453 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235187589] [2021-07-09 16:45:54,453 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235187589] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:45:54,453 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:45:54,453 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 16:45:54,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590771513] [2021-07-09 16:45:54,453 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 16:45:54,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:45:54,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 16:45:54,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-09 16:45:54,454 INFO L87 Difference]: Start difference. First operand 1374 states and 3945 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-07-09 16:45:54,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:45:54,523 INFO L93 Difference]: Finished difference Result 1986 states and 5760 transitions. [2021-07-09 16:45:54,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-09 16:45:54,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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 81 [2021-07-09 16:45:54,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:45:54,525 INFO L225 Difference]: With dead ends: 1986 [2021-07-09 16:45:54,525 INFO L226 Difference]: Without dead ends: 795 [2021-07-09 16:45:54,525 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 67.6ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:45:54,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2021-07-09 16:45:54,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2021-07-09 16:45:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 794 states have (on average 2.7896725440806045) internal successors, (2215), 794 states have internal predecessors, (2215), 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-07-09 16:45:54,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 2215 transitions. [2021-07-09 16:45:54,537 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 2215 transitions. Word has length 81 [2021-07-09 16:45:54,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:45:54,538 INFO L482 AbstractCegarLoop]: Abstraction has 795 states and 2215 transitions. [2021-07-09 16:45:54,538 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-07-09 16:45:54,538 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 2215 transitions. [2021-07-09 16:45:54,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-07-09 16:45:54,539 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:45:54,539 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-09 16:45:54,539 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-07-09 16:45:54,540 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:45:54,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:45:54,540 INFO L82 PathProgramCache]: Analyzing trace with hash 395422294, now seen corresponding path program 2 times [2021-07-09 16:45:54,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:45:54,540 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972493554] [2021-07-09 16:45:54,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:45:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-09 16:45:54,567 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-09 16:45:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-09 16:45:54,603 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-09 16:45:54,633 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-09 16:45:54,633 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-09 16:45:54,633 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-07-09 16:45:54,633 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2021-07-09 16:45:54,634 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-09 16:45:54,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.07 04:45:54 BasicIcfg [2021-07-09 16:45:54,729 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-09 16:45:54,730 INFO L168 Benchmark]: Toolchain (without parser) took 10441.26 ms. Allocated memory was 196.1 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 159.3 MB in the beginning and 459.6 MB in the end (delta: -300.3 MB). Peak memory consumption was 851.6 MB. Max. memory is 8.0 GB. [2021-07-09 16:45:54,730 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 196.1 MB. Free memory was 177.8 MB in the beginning and 177.6 MB in the end (delta: 139.9 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-07-09 16:45:54,730 INFO L168 Benchmark]: CACSL2BoogieTranslator took 449.34 ms. Allocated memory is still 196.1 MB. Free memory was 159.0 MB in the beginning and 166.5 MB in the end (delta: -7.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-07-09 16:45:54,730 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.42 ms. Allocated memory is still 196.1 MB. Free memory was 166.5 MB in the beginning and 163.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-07-09 16:45:54,730 INFO L168 Benchmark]: Boogie Preprocessor took 53.92 ms. Allocated memory is still 196.1 MB. Free memory was 163.4 MB in the beginning and 161.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-09 16:45:54,731 INFO L168 Benchmark]: RCFGBuilder took 1407.97 ms. Allocated memory was 196.1 MB in the beginning and 235.9 MB in the end (delta: 39.8 MB). Free memory was 161.3 MB in the beginning and 209.9 MB in the end (delta: -48.6 MB). Peak memory consumption was 99.8 MB. Max. memory is 8.0 GB. [2021-07-09 16:45:54,731 INFO L168 Benchmark]: TraceAbstraction took 8490.35 ms. Allocated memory was 235.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 209.4 MB in the beginning and 459.6 MB in the end (delta: -250.2 MB). Peak memory consumption was 860.2 MB. Max. memory is 8.0 GB. [2021-07-09 16:45:54,731 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.14 ms. Allocated memory is still 196.1 MB. Free memory was 177.8 MB in the beginning and 177.6 MB in the end (delta: 139.9 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 449.34 ms. Allocated memory is still 196.1 MB. Free memory was 159.0 MB in the beginning and 166.5 MB in the end (delta: -7.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 35.42 ms. Allocated memory is still 196.1 MB. Free memory was 166.5 MB in the beginning and 163.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 53.92 ms. Allocated memory is still 196.1 MB. Free memory was 163.4 MB in the beginning and 161.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1407.97 ms. Allocated memory was 196.1 MB in the beginning and 235.9 MB in the end (delta: 39.8 MB). Free memory was 161.3 MB in the beginning and 209.9 MB in the end (delta: -48.6 MB). Peak memory consumption was 99.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 8490.35 ms. Allocated memory was 235.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 209.4 MB in the beginning and 459.6 MB in the end (delta: -250.2 MB). Peak memory consumption was 860.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t1504; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1504, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1505; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1505, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1506; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t1506, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 x = 2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P2Thread1of1ForFork0 with 1 thread instances CFG has 7 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 593.1ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 36.3ms, AutomataDifference: 116.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 153.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 89 SDtfs, 35 SDslu, 26 SDs, 0 SdLazy, 3 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5016occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 6.6ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 10.2ms SsaConstructionTime, 63.9ms SatisfiabilityAnalysisTime, 114.1ms InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 110 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7722.1ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 201.5ms, AutomataDifference: 3335.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 167.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1823 SDtfs, 2847 SDslu, 7209 SDs, 0 SdLazy, 922 SolverSat, 187 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 749.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1940.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=8544occurred in iteration=0, InterpolantAutomatonStates: 149, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1874.3ms AutomataMinimizationTime, 13 MinimizatonAttempts, 1180 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 37.8ms SsaConstructionTime, 432.5ms SatisfiabilityAnalysisTime, 1490.2ms InterpolantComputationTime, 1029 NumberOfCodeBlocks, 1029 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 935 ConstructedInterpolants, 0 QuantifiedInterpolants, 5245 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...