/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/mix055_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9bbddad6b14272d9691b7fb6f1c011d15ab18596-9bbddad [2021-06-12 17:07:00,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-12 17:07:00,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-12 17:07:00,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-12 17:07:00,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-12 17:07:00,472 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-12 17:07:00,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-12 17:07:00,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-12 17:07:00,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-12 17:07:00,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-12 17:07:00,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-12 17:07:00,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-12 17:07:00,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-12 17:07:00,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-12 17:07:00,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-12 17:07:00,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-12 17:07:00,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-12 17:07:00,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-12 17:07:00,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-12 17:07:00,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-12 17:07:00,508 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-12 17:07:00,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-12 17:07:00,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-12 17:07:00,523 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-12 17:07:00,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-12 17:07:00,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-12 17:07:00,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-12 17:07:00,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-12 17:07:00,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-12 17:07:00,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-12 17:07:00,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-12 17:07:00,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-12 17:07:00,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-12 17:07:00,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-12 17:07:00,538 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-12 17:07:00,538 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-12 17:07:00,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-12 17:07:00,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-12 17:07:00,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-12 17:07:00,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-12 17:07:00,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-12 17:07:00,544 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-06-12 17:07:00,581 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-12 17:07:00,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-12 17:07:00,582 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-12 17:07:00,582 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-12 17:07:00,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-12 17:07:00,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-12 17:07:00,585 INFO L138 SettingsManager]: * Use SBE=true [2021-06-12 17:07:00,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-12 17:07:00,585 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-12 17:07:00,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-12 17:07:00,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-12 17:07:00,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-12 17:07:00,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-12 17:07:00,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-12 17:07:00,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-12 17:07:00,587 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-12 17:07:00,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-12 17:07:00,587 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-12 17:07:00,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-12 17:07:00,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-12 17:07:00,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-12 17:07:00,588 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-12 17:07:00,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-12 17:07:00,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-12 17:07:00,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-12 17:07:00,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-12 17:07:00,589 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-12 17:07:00,589 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-12 17:07:00,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-12 17:07:00,589 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-12 17:07:00,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-12 17:07:00,589 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-06-12 17:07:00,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-12 17:07:00,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-12 17:07:00,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-12 17:07:00,895 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-12 17:07:00,895 INFO L275 PluginConnector]: CDTParser initialized [2021-06-12 17:07:00,896 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i [2021-06-12 17:07:00,944 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c30de4d3a/5e8aa72a11e94f5984bd9e77e3e13b67/FLAG8697a557d [2021-06-12 17:07:01,582 INFO L306 CDTParser]: Found 1 translation units. [2021-06-12 17:07:01,583 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i [2021-06-12 17:07:01,600 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c30de4d3a/5e8aa72a11e94f5984bd9e77e3e13b67/FLAG8697a557d [2021-06-12 17:07:01,926 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c30de4d3a/5e8aa72a11e94f5984bd9e77e3e13b67 [2021-06-12 17:07:01,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-12 17:07:01,929 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-12 17:07:01,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-12 17:07:01,942 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-12 17:07:01,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-12 17:07:01,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.06 05:07:01" (1/1) ... [2021-06-12 17:07:01,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f4eb6ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:07:01, skipping insertion in model container [2021-06-12 17:07:01,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.06 05:07:01" (1/1) ... [2021-06-12 17:07:01,956 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-12 17:07:02,007 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-12 17:07:02,121 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/mix055_tso.oepc.i[949,962] [2021-06-12 17:07:02,369 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-12 17:07:02,378 INFO L203 MainTranslator]: Completed pre-run [2021-06-12 17:07:02,388 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/mix055_tso.oepc.i[949,962] [2021-06-12 17:07:02,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-12 17:07:02,530 INFO L208 MainTranslator]: Completed translation [2021-06-12 17:07:02,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:07:02 WrapperNode [2021-06-12 17:07:02,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-12 17:07:02,532 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-12 17:07:02,532 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-12 17:07:02,532 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-12 17:07:02,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:07:02" (1/1) ... [2021-06-12 17:07:02,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:07:02" (1/1) ... [2021-06-12 17:07:02,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-12 17:07:02,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-12 17:07:02,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-12 17:07:02,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-12 17:07:02,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:07:02" (1/1) ... [2021-06-12 17:07:02,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:07:02" (1/1) ... [2021-06-12 17:07:02,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:07:02" (1/1) ... [2021-06-12 17:07:02,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:07:02" (1/1) ... [2021-06-12 17:07:02,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:07:02" (1/1) ... [2021-06-12 17:07:02,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:07:02" (1/1) ... [2021-06-12 17:07:02,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:07:02" (1/1) ... [2021-06-12 17:07:02,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-12 17:07:02,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-12 17:07:02,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-12 17:07:02,658 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-12 17:07:02,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:07:02" (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-06-12 17:07:02,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-12 17:07:02,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-12 17:07:02,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-12 17:07:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-12 17:07:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-12 17:07:02,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-12 17:07:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-12 17:07:02,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-12 17:07:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-12 17:07:02,746 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-12 17:07:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-06-12 17:07:02,746 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-06-12 17:07:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-12 17:07:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-12 17:07:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-12 17:07:02,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-12 17:07:02,748 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-12 17:07:04,676 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-12 17:07:04,677 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-12 17:07:04,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 05:07:04 BoogieIcfgContainer [2021-06-12 17:07:04,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-12 17:07:04,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-12 17:07:04,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-12 17:07:04,682 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-12 17:07:04,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.06 05:07:01" (1/3) ... [2021-06-12 17:07:04,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b09b1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 05:07:04, skipping insertion in model container [2021-06-12 17:07:04,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:07:02" (2/3) ... [2021-06-12 17:07:04,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b09b1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 05:07:04, skipping insertion in model container [2021-06-12 17:07:04,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 05:07:04" (3/3) ... [2021-06-12 17:07:04,684 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_tso.oepc.i [2021-06-12 17:07:04,690 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-12 17:07:04,690 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-12 17:07:04,690 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-12 17:07:04,691 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-12 17:07:04,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,724 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,724 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,724 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,724 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,728 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,728 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,728 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,728 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,729 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,729 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,729 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,729 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,758 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,758 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,759 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,759 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,763 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,763 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,764 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,765 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,768 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,769 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,769 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,769 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,773 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,774 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,775 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,775 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,775 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,775 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,775 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,775 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,775 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,776 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,776 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,776 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,777 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,779 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,780 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,783 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,783 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,783 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,783 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,783 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,783 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,783 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,784 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,784 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,784 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,786 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,786 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,786 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,786 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,786 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,787 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,787 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,787 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,787 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,787 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,788 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,789 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,789 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:07:04,791 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-12 17:07:04,809 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-12 17:07:04,834 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 17:07:04,834 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 17:07:04,835 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 17:07:04,835 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 17:07:04,835 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 17:07:04,835 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 17:07:04,835 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 17:07:04,835 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1======== [2021-06-12 17:07:04,848 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 138 places, 127 transitions, 274 flow [2021-06-12 17:07:35,824 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 138267 states, 138263 states have (on average 4.513289889558306) internal successors, (624021), 138266 states have internal predecessors, (624021), 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-06-12 17:07:36,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 138267 states, 138263 states have (on average 4.513289889558306) internal successors, (624021), 138266 states have internal predecessors, (624021), 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-06-12 17:07:37,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 17:07:37,245 INFO L301 ceAbstractionStarter]: Result for error location P1 was SAFE (1/3) [2021-06-12 17:07:37,247 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-12 17:07:37,248 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 17:07:37,248 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 17:07:37,248 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 17:07:37,248 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 17:07:37,248 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 17:07:37,248 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 17:07:37,249 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 17:07:37,249 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1Thread1of1ForFork3======== [2021-06-12 17:07:37,251 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 138 places, 127 transitions, 274 flow [2021-06-12 17:08:07,575 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 138267 states, 138263 states have (on average 4.513289889558306) internal successors, (624021), 138266 states have internal predecessors, (624021), 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-06-12 17:08:07,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 138267 states, 138263 states have (on average 4.513289889558306) internal successors, (624021), 138266 states have internal predecessors, (624021), 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-06-12 17:08:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-06-12 17:08:07,812 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:08:07,813 INFO L472 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] [2021-06-12 17:08:07,813 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:08:07,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:08:07,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1245645016, now seen corresponding path program 1 times [2021-06-12 17:08:07,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:08:07,824 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269020395] [2021-06-12 17:08:07,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:08:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:08:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:08:08,121 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:08:08,121 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269020395] [2021-06-12 17:08:08,122 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269020395] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:08:08,122 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:08:08,122 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-12 17:08:08,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382381112] [2021-06-12 17:08:08,127 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 17:08:08,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:08:08,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 17:08:08,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 17:08:08,315 INFO L87 Difference]: Start difference. First operand has 138267 states, 138263 states have (on average 4.513289889558306) internal successors, (624021), 138266 states have internal predecessors, (624021), 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 26.0) internal successors, (52), 3 states have internal predecessors, (52), 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-06-12 17:08:10,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:08:10,467 INFO L93 Difference]: Finished difference Result 118819 states and 526372 transitions. [2021-06-12 17:08:10,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 17:08:10,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2021-06-12 17:08:10,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:08:10,478 INFO L225 Difference]: With dead ends: 118819 [2021-06-12 17:08:10,478 INFO L226 Difference]: Without dead ends: 0 [2021-06-12 17:08:10,480 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 17:08:10,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-12 17:08:10,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-12 17:08:10,497 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-06-12 17:08:10,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-12 17:08:10,498 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2021-06-12 17:08:10,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:08:10,498 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-12 17:08:10,498 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 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-06-12 17:08:10,499 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-12 17:08:10,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 17:08:10,499 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-12 17:08:10,499 INFO L301 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork3 was SAFE (2/3) [2021-06-12 17:08:10,500 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-12 17:08:10,501 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 17:08:10,501 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 17:08:10,502 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 17:08:10,502 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 17:08:10,502 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 17:08:10,502 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 17:08:10,502 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 17:08:10,502 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-12 17:08:10,504 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 138 places, 127 transitions, 274 flow [2021-06-12 17:08:39,917 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 138267 states, 138263 states have (on average 4.513289889558306) internal successors, (624021), 138266 states have internal predecessors, (624021), 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-06-12 17:08:40,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 138267 states, 138263 states have (on average 4.513289889558306) internal successors, (624021), 138266 states have internal predecessors, (624021), 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-06-12 17:08:40,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-06-12 17:08:40,317 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:08:40,318 INFO L472 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] [2021-06-12 17:08:40,318 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:08:40,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:08:40,318 INFO L82 PathProgramCache]: Analyzing trace with hash -529600904, now seen corresponding path program 1 times [2021-06-12 17:08:40,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:08:40,319 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670666522] [2021-06-12 17:08:40,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:08:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:08:40,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:08:40,582 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:08:40,582 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670666522] [2021-06-12 17:08:40,583 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670666522] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:08:40,583 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:08:40,583 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 17:08:40,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666582145] [2021-06-12 17:08:40,584 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 17:08:40,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:08:40,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 17:08:40,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 17:08:40,751 INFO L87 Difference]: Start difference. First operand has 138267 states, 138263 states have (on average 4.513289889558306) internal successors, (624021), 138266 states have internal predecessors, (624021), 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 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-06-12 17:08:43,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:08:43,200 INFO L93 Difference]: Finished difference Result 199611 states and 885585 transitions. [2021-06-12 17:08:43,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 17:08:43,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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 78 [2021-06-12 17:08:43,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:08:44,439 INFO L225 Difference]: With dead ends: 199611 [2021-06-12 17:08:44,440 INFO L226 Difference]: Without dead ends: 71163 [2021-06-12 17:08:44,457 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 97.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 17:08:45,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71163 states. [2021-06-12 17:08:47,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71163 to 71163. [2021-06-12 17:08:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71163 states, 71161 states have (on average 4.37398294009359) internal successors, (311257), 71162 states have internal predecessors, (311257), 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-06-12 17:08:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71163 states to 71163 states and 311257 transitions. [2021-06-12 17:08:48,654 INFO L78 Accepts]: Start accepts. Automaton has 71163 states and 311257 transitions. Word has length 78 [2021-06-12 17:08:48,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:08:48,655 INFO L482 AbstractCegarLoop]: Abstraction has 71163 states and 311257 transitions. [2021-06-12 17:08:48,656 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-06-12 17:08:48,656 INFO L276 IsEmpty]: Start isEmpty. Operand 71163 states and 311257 transitions. [2021-06-12 17:08:49,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-12 17:08:49,011 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:08:49,011 INFO L472 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] [2021-06-12 17:08:49,011 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-12 17:08:49,011 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:08:49,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:08:49,012 INFO L82 PathProgramCache]: Analyzing trace with hash -2138654727, now seen corresponding path program 1 times [2021-06-12 17:08:49,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:08:49,012 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139303145] [2021-06-12 17:08:49,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:08:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:08:49,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:08:49,346 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:08:49,346 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139303145] [2021-06-12 17:08:49,346 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139303145] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:08:49,346 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:08:49,346 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-12 17:08:49,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475891298] [2021-06-12 17:08:49,347 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-12 17:08:49,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:08:49,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-12 17:08:49,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-12 17:08:49,349 INFO L87 Difference]: Start difference. First operand 71163 states and 311257 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 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-06-12 17:08:50,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:08:50,742 INFO L93 Difference]: Finished difference Result 86130 states and 374015 transitions. [2021-06-12 17:08:50,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-12 17:08:50,743 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 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 80 [2021-06-12 17:08:50,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:08:51,153 INFO L225 Difference]: With dead ends: 86130 [2021-06-12 17:08:51,153 INFO L226 Difference]: Without dead ends: 68970 [2021-06-12 17:08:51,154 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 219.6ms TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2021-06-12 17:08:51,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68970 states. [2021-06-12 17:08:53,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68970 to 66114. [2021-06-12 17:08:53,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66114 states, 66112 states have (on average 4.352175096805421) internal successors, (287731), 66113 states have internal predecessors, (287731), 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-06-12 17:08:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66114 states to 66114 states and 287731 transitions. [2021-06-12 17:08:54,094 INFO L78 Accepts]: Start accepts. Automaton has 66114 states and 287731 transitions. Word has length 80 [2021-06-12 17:08:54,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:08:54,095 INFO L482 AbstractCegarLoop]: Abstraction has 66114 states and 287731 transitions. [2021-06-12 17:08:54,095 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 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-06-12 17:08:54,095 INFO L276 IsEmpty]: Start isEmpty. Operand 66114 states and 287731 transitions. [2021-06-12 17:08:54,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-12 17:08:54,183 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:08:54,184 INFO L472 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, 1] [2021-06-12 17:08:54,184 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-12 17:08:54,184 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:08:54,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:08:54,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1180841683, now seen corresponding path program 1 times [2021-06-12 17:08:54,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:08:54,188 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880607336] [2021-06-12 17:08:54,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:08:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:08:54,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:08:54,463 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:08:54,463 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880607336] [2021-06-12 17:08:54,463 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880607336] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:08:54,464 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:08:54,464 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-12 17:08:54,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728229286] [2021-06-12 17:08:54,464 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-12 17:08:54,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:08:54,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-12 17:08:54,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-12 17:08:54,465 INFO L87 Difference]: Start difference. First operand 66114 states and 287731 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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-06-12 17:08:55,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:08:55,551 INFO L93 Difference]: Finished difference Result 80802 states and 350381 transitions. [2021-06-12 17:08:55,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-12 17:08:55,552 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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 82 [2021-06-12 17:08:55,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:08:56,176 INFO L225 Difference]: With dead ends: 80802 [2021-06-12 17:08:56,176 INFO L226 Difference]: Without dead ends: 68514 [2021-06-12 17:08:56,176 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 212.8ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-06-12 17:08:56,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68514 states. [2021-06-12 17:08:58,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68514 to 68514. [2021-06-12 17:08:58,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68514 states, 68512 states have (on average 4.354988907052779) internal successors, (298369), 68513 states have internal predecessors, (298369), 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-06-12 17:08:58,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68514 states to 68514 states and 298369 transitions. [2021-06-12 17:08:58,719 INFO L78 Accepts]: Start accepts. Automaton has 68514 states and 298369 transitions. Word has length 82 [2021-06-12 17:08:58,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:08:58,720 INFO L482 AbstractCegarLoop]: Abstraction has 68514 states and 298369 transitions. [2021-06-12 17:08:58,720 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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-06-12 17:08:58,720 INFO L276 IsEmpty]: Start isEmpty. Operand 68514 states and 298369 transitions. [2021-06-12 17:08:58,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-12 17:08:58,788 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:08:58,788 INFO L472 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, 1, 1] [2021-06-12 17:08:58,788 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-12 17:08:58,788 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:08:58,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:08:58,789 INFO L82 PathProgramCache]: Analyzing trace with hash 880901242, now seen corresponding path program 1 times [2021-06-12 17:08:58,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:08:58,789 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555888009] [2021-06-12 17:08:58,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:08:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:08:59,221 WARN L205 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2021-06-12 17:08:59,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:08:59,291 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:08:59,291 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555888009] [2021-06-12 17:08:59,291 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555888009] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:08:59,291 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:08:59,292 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-12 17:08:59,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173045261] [2021-06-12 17:08:59,292 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-12 17:08:59,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:08:59,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-12 17:08:59,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-12 17:08:59,293 INFO L87 Difference]: Start difference. First operand 68514 states and 298369 transitions. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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-06-12 17:09:00,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:09:00,338 INFO L93 Difference]: Finished difference Result 74043 states and 320448 transitions. [2021-06-12 17:09:00,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-12 17:09:00,338 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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 83 [2021-06-12 17:09:00,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:09:00,594 INFO L225 Difference]: With dead ends: 74043 [2021-06-12 17:09:00,594 INFO L226 Difference]: Without dead ends: 64379 [2021-06-12 17:09:00,594 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 558.6ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-06-12 17:09:00,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64379 states. [2021-06-12 17:09:02,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64379 to 64379. [2021-06-12 17:09:02,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64379 states, 64378 states have (on average 4.351362266612818) internal successors, (280132), 64378 states have internal predecessors, (280132), 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-06-12 17:09:02,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64379 states to 64379 states and 280132 transitions. [2021-06-12 17:09:02,960 INFO L78 Accepts]: Start accepts. Automaton has 64379 states and 280132 transitions. Word has length 83 [2021-06-12 17:09:02,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:09:02,961 INFO L482 AbstractCegarLoop]: Abstraction has 64379 states and 280132 transitions. [2021-06-12 17:09:02,961 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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-06-12 17:09:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 64379 states and 280132 transitions. [2021-06-12 17:09:03,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-12 17:09:03,031 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:09:03,031 INFO L472 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, 1, 1, 1] [2021-06-12 17:09:03,031 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-12 17:09:03,032 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:09:03,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:09:03,032 INFO L82 PathProgramCache]: Analyzing trace with hash -824927493, now seen corresponding path program 1 times [2021-06-12 17:09:03,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:09:03,032 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804966443] [2021-06-12 17:09:03,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:09:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:09:03,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:09:03,291 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:09:03,291 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804966443] [2021-06-12 17:09:03,292 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804966443] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:09:03,292 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:09:03,292 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-12 17:09:03,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190118639] [2021-06-12 17:09:03,292 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-12 17:09:03,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:09:03,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-12 17:09:03,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-06-12 17:09:03,293 INFO L87 Difference]: Start difference. First operand 64379 states and 280132 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 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-06-12 17:09:04,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:09:04,261 INFO L93 Difference]: Finished difference Result 69979 states and 302572 transitions. [2021-06-12 17:09:04,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-12 17:09:04,261 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 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 84 [2021-06-12 17:09:04,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:09:04,791 INFO L225 Difference]: With dead ends: 69979 [2021-06-12 17:09:04,791 INFO L226 Difference]: Without dead ends: 61019 [2021-06-12 17:09:04,791 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 236.6ms TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2021-06-12 17:09:05,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61019 states. [2021-06-12 17:09:06,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61019 to 60099. [2021-06-12 17:09:06,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60099 states, 60098 states have (on average 4.340277546673766) internal successors, (260842), 60098 states have internal predecessors, (260842), 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-06-12 17:09:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60099 states to 60099 states and 260842 transitions. [2021-06-12 17:09:06,832 INFO L78 Accepts]: Start accepts. Automaton has 60099 states and 260842 transitions. Word has length 84 [2021-06-12 17:09:06,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:09:06,832 INFO L482 AbstractCegarLoop]: Abstraction has 60099 states and 260842 transitions. [2021-06-12 17:09:06,832 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 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-06-12 17:09:06,832 INFO L276 IsEmpty]: Start isEmpty. Operand 60099 states and 260842 transitions. [2021-06-12 17:09:07,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-12 17:09:07,294 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:09:07,294 INFO L472 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, 1, 1, 1] [2021-06-12 17:09:07,294 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-12 17:09:07,295 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:09:07,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:09:07,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1783783788, now seen corresponding path program 1 times [2021-06-12 17:09:07,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:09:07,295 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852868207] [2021-06-12 17:09:07,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:09:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:09:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:09:07,484 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:09:07,484 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852868207] [2021-06-12 17:09:07,484 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852868207] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:09:07,484 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:09:07,484 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 17:09:07,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228258650] [2021-06-12 17:09:07,485 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 17:09:07,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:09:07,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 17:09:07,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 17:09:07,486 INFO L87 Difference]: Start difference. First operand 60099 states and 260842 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-06-12 17:09:08,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:09:08,572 INFO L93 Difference]: Finished difference Result 72211 states and 309121 transitions. [2021-06-12 17:09:08,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 17:09:08,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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 84 [2021-06-12 17:09:08,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:09:08,992 INFO L225 Difference]: With dead ends: 72211 [2021-06-12 17:09:08,992 INFO L226 Difference]: Without dead ends: 54675 [2021-06-12 17:09:08,992 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 115.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 17:09:09,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54675 states. [2021-06-12 17:09:10,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54675 to 54675. [2021-06-12 17:09:10,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54675 states, 54674 states have (on average 4.274828986355489) internal successors, (233722), 54674 states have internal predecessors, (233722), 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-06-12 17:09:11,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54675 states to 54675 states and 233722 transitions. [2021-06-12 17:09:11,059 INFO L78 Accepts]: Start accepts. Automaton has 54675 states and 233722 transitions. Word has length 84 [2021-06-12 17:09:11,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:09:11,059 INFO L482 AbstractCegarLoop]: Abstraction has 54675 states and 233722 transitions. [2021-06-12 17:09:11,060 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-06-12 17:09:11,060 INFO L276 IsEmpty]: Start isEmpty. Operand 54675 states and 233722 transitions. [2021-06-12 17:09:11,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-12 17:09:11,126 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:09:11,126 INFO L472 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, 1, 1, 1, 1] [2021-06-12 17:09:11,126 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-12 17:09:11,126 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:09:11,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:09:11,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2026030582, now seen corresponding path program 1 times [2021-06-12 17:09:11,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:09:11,127 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643593336] [2021-06-12 17:09:11,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:09:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:09:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:09:11,217 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:09:11,217 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643593336] [2021-06-12 17:09:11,217 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643593336] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:09:11,217 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:09:11,218 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-12 17:09:11,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583978100] [2021-06-12 17:09:11,218 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-12 17:09:11,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:09:11,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-12 17:09:11,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-12 17:09:11,219 INFO L87 Difference]: Start difference. First operand 54675 states and 233722 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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-06-12 17:09:11,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:09:11,976 INFO L93 Difference]: Finished difference Result 53979 states and 224813 transitions. [2021-06-12 17:09:11,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-12 17:09:11,977 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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 85 [2021-06-12 17:09:11,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:09:12,081 INFO L225 Difference]: With dead ends: 53979 [2021-06-12 17:09:12,081 INFO L226 Difference]: Without dead ends: 39159 [2021-06-12 17:09:12,081 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 98.4ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-12 17:09:12,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39159 states. [2021-06-12 17:09:13,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39159 to 38415. [2021-06-12 17:09:13,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38415 states, 38414 states have (on average 4.1167282761493205) internal successors, (158140), 38414 states have internal predecessors, (158140), 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-06-12 17:09:13,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38415 states to 38415 states and 158140 transitions. [2021-06-12 17:09:13,374 INFO L78 Accepts]: Start accepts. Automaton has 38415 states and 158140 transitions. Word has length 85 [2021-06-12 17:09:13,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:09:13,375 INFO L482 AbstractCegarLoop]: Abstraction has 38415 states and 158140 transitions. [2021-06-12 17:09:13,375 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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-06-12 17:09:13,375 INFO L276 IsEmpty]: Start isEmpty. Operand 38415 states and 158140 transitions. [2021-06-12 17:09:13,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-12 17:09:13,430 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:09:13,430 INFO L472 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, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 17:09:13,430 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-12 17:09:13,431 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:09:13,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:09:13,431 INFO L82 PathProgramCache]: Analyzing trace with hash -894585318, now seen corresponding path program 1 times [2021-06-12 17:09:13,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:09:13,431 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820699207] [2021-06-12 17:09:13,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:09:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:09:13,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:09:13,527 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:09:13,527 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820699207] [2021-06-12 17:09:13,527 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820699207] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:09:13,527 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:09:13,527 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 17:09:13,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467026250] [2021-06-12 17:09:13,528 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 17:09:13,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:09:13,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 17:09:13,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 17:09:13,528 INFO L87 Difference]: Start difference. First operand 38415 states and 158140 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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-06-12 17:09:14,068 WARN L205 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2021-06-12 17:09:14,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:09:14,218 INFO L93 Difference]: Finished difference Result 62121 states and 254362 transitions. [2021-06-12 17:09:14,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 17:09:14,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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 88 [2021-06-12 17:09:14,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:09:14,344 INFO L225 Difference]: With dead ends: 62121 [2021-06-12 17:09:14,345 INFO L226 Difference]: Without dead ends: 40791 [2021-06-12 17:09:14,345 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 339.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 17:09:14,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40791 states. [2021-06-12 17:09:15,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40791 to 37011. [2021-06-12 17:09:15,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37011 states, 37010 states have (on average 4.0569575790326935) internal successors, (150148), 37010 states have internal predecessors, (150148), 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-06-12 17:09:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37011 states to 37011 states and 150148 transitions. [2021-06-12 17:09:15,775 INFO L78 Accepts]: Start accepts. Automaton has 37011 states and 150148 transitions. Word has length 88 [2021-06-12 17:09:15,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:09:15,775 INFO L482 AbstractCegarLoop]: Abstraction has 37011 states and 150148 transitions. [2021-06-12 17:09:15,775 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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-06-12 17:09:15,775 INFO L276 IsEmpty]: Start isEmpty. Operand 37011 states and 150148 transitions. [2021-06-12 17:09:15,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-12 17:09:15,851 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:09:15,851 INFO L472 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, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 17:09:15,852 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-12 17:09:15,852 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:09:15,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:09:15,852 INFO L82 PathProgramCache]: Analyzing trace with hash -718218399, now seen corresponding path program 1 times [2021-06-12 17:09:15,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:09:15,852 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476452953] [2021-06-12 17:09:15,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:09:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:09:16,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:09:16,013 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:09:16,013 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476452953] [2021-06-12 17:09:16,014 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476452953] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:09:16,014 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:09:16,014 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-12 17:09:16,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570876816] [2021-06-12 17:09:16,014 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-12 17:09:16,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:09:16,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-12 17:09:16,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-12 17:09:16,015 INFO L87 Difference]: Start difference. First operand 37011 states and 150148 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-06-12 17:09:16,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:09:16,303 INFO L93 Difference]: Finished difference Result 31611 states and 125317 transitions. [2021-06-12 17:09:16,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-12 17:09:16,304 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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 88 [2021-06-12 17:09:16,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:09:16,361 INFO L225 Difference]: With dead ends: 31611 [2021-06-12 17:09:16,361 INFO L226 Difference]: Without dead ends: 23511 [2021-06-12 17:09:16,361 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 111.2ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-12 17:09:16,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23511 states. [2021-06-12 17:09:16,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23511 to 23223. [2021-06-12 17:09:16,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23223 states, 23222 states have (on average 3.9251571785375936) internal successors, (91150), 23222 states have internal predecessors, (91150), 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-06-12 17:09:17,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23223 states to 23223 states and 91150 transitions. [2021-06-12 17:09:17,023 INFO L78 Accepts]: Start accepts. Automaton has 23223 states and 91150 transitions. Word has length 88 [2021-06-12 17:09:17,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:09:17,024 INFO L482 AbstractCegarLoop]: Abstraction has 23223 states and 91150 transitions. [2021-06-12 17:09:17,024 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-06-12 17:09:17,024 INFO L276 IsEmpty]: Start isEmpty. Operand 23223 states and 91150 transitions. [2021-06-12 17:09:17,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-06-12 17:09:17,058 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:09:17,059 INFO L472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 17:09:17,059 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-12 17:09:17,059 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:09:17,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:09:17,059 INFO L82 PathProgramCache]: Analyzing trace with hash -10092157, now seen corresponding path program 1 times [2021-06-12 17:09:17,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:09:17,060 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794940261] [2021-06-12 17:09:17,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:09:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:09:17,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:09:17,192 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:09:17,192 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794940261] [2021-06-12 17:09:17,192 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794940261] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:09:17,192 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:09:17,192 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-12 17:09:17,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421681015] [2021-06-12 17:09:17,192 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-12 17:09:17,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:09:17,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-12 17:09:17,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-12 17:09:17,193 INFO L87 Difference]: Start difference. First operand 23223 states and 91150 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 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-06-12 17:09:17,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:09:17,704 INFO L93 Difference]: Finished difference Result 34437 states and 134845 transitions. [2021-06-12 17:09:17,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-12 17:09:17,704 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 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 93 [2021-06-12 17:09:17,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:09:17,763 INFO L225 Difference]: With dead ends: 34437 [2021-06-12 17:09:17,763 INFO L226 Difference]: Without dead ends: 23601 [2021-06-12 17:09:17,765 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 76.7ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-12 17:09:17,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23601 states. [2021-06-12 17:09:18,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23601 to 22791. [2021-06-12 17:09:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22791 states, 22790 states have (on average 3.8621325142606406) internal successors, (88018), 22790 states have internal predecessors, (88018), 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-06-12 17:09:18,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22791 states to 22791 states and 88018 transitions. [2021-06-12 17:09:18,439 INFO L78 Accepts]: Start accepts. Automaton has 22791 states and 88018 transitions. Word has length 93 [2021-06-12 17:09:18,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:09:18,439 INFO L482 AbstractCegarLoop]: Abstraction has 22791 states and 88018 transitions. [2021-06-12 17:09:18,440 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 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-06-12 17:09:18,440 INFO L276 IsEmpty]: Start isEmpty. Operand 22791 states and 88018 transitions. [2021-06-12 17:09:18,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-06-12 17:09:18,475 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:09:18,475 INFO L472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 17:09:18,476 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-12 17:09:18,476 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:09:18,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:09:18,476 INFO L82 PathProgramCache]: Analyzing trace with hash 910736387, now seen corresponding path program 2 times [2021-06-12 17:09:18,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:09:18,476 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633925706] [2021-06-12 17:09:18,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:09:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:09:18,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:09:18,660 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:09:18,660 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633925706] [2021-06-12 17:09:18,660 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633925706] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:09:18,660 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:09:18,660 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-12 17:09:18,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596895913] [2021-06-12 17:09:18,661 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-12 17:09:18,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:09:18,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-12 17:09:18,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-06-12 17:09:18,663 INFO L87 Difference]: Start difference. First operand 22791 states and 88018 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 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-06-12 17:09:19,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:09:19,088 INFO L93 Difference]: Finished difference Result 36273 states and 138709 transitions. [2021-06-12 17:09:19,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-12 17:09:19,089 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 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 93 [2021-06-12 17:09:19,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:09:19,157 INFO L225 Difference]: With dead ends: 36273 [2021-06-12 17:09:19,157 INFO L226 Difference]: Without dead ends: 27981 [2021-06-12 17:09:19,157 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 188.1ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-06-12 17:09:19,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27981 states. [2021-06-12 17:09:19,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27981 to 23711. [2021-06-12 17:09:19,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23711 states, 23710 states have (on average 3.832307043441586) internal successors, (90864), 23710 states have internal predecessors, (90864), 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-06-12 17:09:19,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23711 states to 23711 states and 90864 transitions. [2021-06-12 17:09:19,859 INFO L78 Accepts]: Start accepts. Automaton has 23711 states and 90864 transitions. Word has length 93 [2021-06-12 17:09:19,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:09:19,859 INFO L482 AbstractCegarLoop]: Abstraction has 23711 states and 90864 transitions. [2021-06-12 17:09:19,859 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 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-06-12 17:09:19,859 INFO L276 IsEmpty]: Start isEmpty. Operand 23711 states and 90864 transitions. [2021-06-12 17:09:19,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-06-12 17:09:19,894 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:09:19,894 INFO L472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 17:09:19,894 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-12 17:09:19,895 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:09:19,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:09:19,895 INFO L82 PathProgramCache]: Analyzing trace with hash 182884069, now seen corresponding path program 3 times [2021-06-12 17:09:19,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:09:19,895 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956528522] [2021-06-12 17:09:19,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:09:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:09:20,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:09:20,321 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:09:20,322 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956528522] [2021-06-12 17:09:20,322 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956528522] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:09:20,322 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:09:20,322 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-12 17:09:20,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175277632] [2021-06-12 17:09:20,322 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-12 17:09:20,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:09:20,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-12 17:09:20,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-06-12 17:09:20,323 INFO L87 Difference]: Start difference. First operand 23711 states and 90864 transitions. Second operand has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 14 states have internal predecessors, (93), 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-06-12 17:09:20,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:09:20,946 INFO L93 Difference]: Finished difference Result 35181 states and 134344 transitions. [2021-06-12 17:09:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-12 17:09:20,947 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 14 states have internal predecessors, (93), 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 93 [2021-06-12 17:09:20,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:09:21,022 INFO L225 Difference]: With dead ends: 35181 [2021-06-12 17:09:21,023 INFO L226 Difference]: Without dead ends: 28905 [2021-06-12 17:09:21,023 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 300.6ms TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2021-06-12 17:09:21,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28905 states. [2021-06-12 17:09:21,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28905 to 23309. [2021-06-12 17:09:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23309 states, 23308 states have (on average 3.8298867341685257) internal successors, (89267), 23308 states have internal predecessors, (89267), 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-06-12 17:09:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23309 states to 23309 states and 89267 transitions. [2021-06-12 17:09:21,657 INFO L78 Accepts]: Start accepts. Automaton has 23309 states and 89267 transitions. Word has length 93 [2021-06-12 17:09:21,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:09:21,657 INFO L482 AbstractCegarLoop]: Abstraction has 23309 states and 89267 transitions. [2021-06-12 17:09:21,657 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 14 states have internal predecessors, (93), 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-06-12 17:09:21,657 INFO L276 IsEmpty]: Start isEmpty. Operand 23309 states and 89267 transitions. [2021-06-12 17:09:21,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-06-12 17:09:21,693 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:09:21,693 INFO L472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 17:09:21,693 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-12 17:09:21,693 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:09:21,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:09:21,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1825737243, now seen corresponding path program 4 times [2021-06-12 17:09:21,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:09:21,694 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132573393] [2021-06-12 17:09:21,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:09:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:09:21,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:09:21,800 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:09:21,801 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132573393] [2021-06-12 17:09:21,801 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132573393] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:09:21,801 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:09:21,801 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-12 17:09:21,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089315537] [2021-06-12 17:09:21,801 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-12 17:09:21,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:09:21,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-12 17:09:21,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-12 17:09:21,803 INFO L87 Difference]: Start difference. First operand 23309 states and 89267 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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-06-12 17:09:22,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:09:22,240 INFO L93 Difference]: Finished difference Result 19799 states and 75200 transitions. [2021-06-12 17:09:22,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-12 17:09:22,241 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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 93 [2021-06-12 17:09:22,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:09:22,264 INFO L225 Difference]: With dead ends: 19799 [2021-06-12 17:09:22,264 INFO L226 Difference]: Without dead ends: 7513 [2021-06-12 17:09:22,265 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 123.9ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-06-12 17:09:22,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7513 states. [2021-06-12 17:09:22,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7513 to 6613. [2021-06-12 17:09:22,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6613 states, 6612 states have (on average 3.731397459165154) internal successors, (24672), 6612 states have internal predecessors, (24672), 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-06-12 17:09:22,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6613 states to 6613 states and 24672 transitions. [2021-06-12 17:09:22,391 INFO L78 Accepts]: Start accepts. Automaton has 6613 states and 24672 transitions. Word has length 93 [2021-06-12 17:09:22,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:09:22,391 INFO L482 AbstractCegarLoop]: Abstraction has 6613 states and 24672 transitions. [2021-06-12 17:09:22,391 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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-06-12 17:09:22,391 INFO L276 IsEmpty]: Start isEmpty. Operand 6613 states and 24672 transitions. [2021-06-12 17:09:22,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-06-12 17:09:22,402 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:09:22,402 INFO L472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 17:09:22,402 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-12 17:09:22,402 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:09:22,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:09:22,402 INFO L82 PathProgramCache]: Analyzing trace with hash -354579694, now seen corresponding path program 1 times [2021-06-12 17:09:22,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:09:22,402 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162420032] [2021-06-12 17:09:22,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:09:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:09:22,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:09:22,736 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:09:22,736 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162420032] [2021-06-12 17:09:22,736 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162420032] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:09:22,736 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:09:22,736 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-12 17:09:22,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052349521] [2021-06-12 17:09:22,737 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-12 17:09:22,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:09:22,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-12 17:09:22,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-06-12 17:09:22,737 INFO L87 Difference]: Start difference. First operand 6613 states and 24672 transitions. Second operand has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 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-06-12 17:09:23,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:09:23,063 INFO L93 Difference]: Finished difference Result 8923 states and 33367 transitions. [2021-06-12 17:09:23,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-12 17:09:23,064 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 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 98 [2021-06-12 17:09:23,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:09:23,081 INFO L225 Difference]: With dead ends: 8923 [2021-06-12 17:09:23,081 INFO L226 Difference]: Without dead ends: 6769 [2021-06-12 17:09:23,082 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 300.0ms TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2021-06-12 17:09:23,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6769 states. [2021-06-12 17:09:23,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6769 to 6469. [2021-06-12 17:09:23,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6469 states, 6468 states have (on average 3.732838589981447) internal successors, (24144), 6468 states have internal predecessors, (24144), 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-06-12 17:09:23,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6469 states to 6469 states and 24144 transitions. [2021-06-12 17:09:23,358 INFO L78 Accepts]: Start accepts. Automaton has 6469 states and 24144 transitions. Word has length 98 [2021-06-12 17:09:23,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:09:23,358 INFO L482 AbstractCegarLoop]: Abstraction has 6469 states and 24144 transitions. [2021-06-12 17:09:23,358 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 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-06-12 17:09:23,358 INFO L276 IsEmpty]: Start isEmpty. Operand 6469 states and 24144 transitions. [2021-06-12 17:09:23,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-06-12 17:09:23,368 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:09:23,368 INFO L472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 17:09:23,368 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-12 17:09:23,369 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:09:23,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:09:23,369 INFO L82 PathProgramCache]: Analyzing trace with hash 259011956, now seen corresponding path program 2 times [2021-06-12 17:09:23,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:09:23,369 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919659188] [2021-06-12 17:09:23,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:09:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:09:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:09:23,630 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:09:23,630 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919659188] [2021-06-12 17:09:23,632 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919659188] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:09:23,632 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:09:23,632 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-12 17:09:23,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910039543] [2021-06-12 17:09:23,633 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-12 17:09:23,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:09:23,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-12 17:09:23,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-06-12 17:09:23,633 INFO L87 Difference]: Start difference. First operand 6469 states and 24144 transitions. Second operand has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 15 states have internal predecessors, (98), 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-06-12 17:09:23,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:09:23,923 INFO L93 Difference]: Finished difference Result 9529 states and 35889 transitions. [2021-06-12 17:09:23,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-12 17:09:23,924 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 15 states have internal predecessors, (98), 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 98 [2021-06-12 17:09:23,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:09:23,942 INFO L225 Difference]: With dead ends: 9529 [2021-06-12 17:09:23,942 INFO L226 Difference]: Without dead ends: 6687 [2021-06-12 17:09:23,943 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 233.9ms TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:09:23,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6687 states. [2021-06-12 17:09:24,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6687 to 5937. [2021-06-12 17:09:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5937 states, 5936 states have (on average 3.7776280323450133) internal successors, (22424), 5936 states have internal predecessors, (22424), 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-06-12 17:09:24,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5937 states to 5937 states and 22424 transitions. [2021-06-12 17:09:24,065 INFO L78 Accepts]: Start accepts. Automaton has 5937 states and 22424 transitions. Word has length 98 [2021-06-12 17:09:24,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:09:24,065 INFO L482 AbstractCegarLoop]: Abstraction has 5937 states and 22424 transitions. [2021-06-12 17:09:24,065 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 15 states have internal predecessors, (98), 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-06-12 17:09:24,065 INFO L276 IsEmpty]: Start isEmpty. Operand 5937 states and 22424 transitions. [2021-06-12 17:09:24,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-06-12 17:09:24,073 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:09:24,074 INFO L472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 17:09:24,074 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-12 17:09:24,074 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:09:24,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:09:24,074 INFO L82 PathProgramCache]: Analyzing trace with hash 960244818, now seen corresponding path program 3 times [2021-06-12 17:09:24,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:09:24,074 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076691825] [2021-06-12 17:09:24,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:09:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-12 17:09:24,114 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-12 17:09:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-12 17:09:24,165 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-12 17:09:24,220 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-12 17:09:24,220 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-12 17:09:24,220 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-12 17:09:24,220 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/3) [2021-06-12 17:09:24,221 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-12 17:09:24,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.06 05:09:24 BasicIcfg [2021-06-12 17:09:24,421 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-12 17:09:24,422 INFO L168 Benchmark]: Toolchain (without parser) took 142492.64 ms. Allocated memory was 255.9 MB in the beginning and 7.9 GB in the end (delta: 7.6 GB). Free memory was 218.9 MB in the beginning and 4.5 GB in the end (delta: -4.3 GB). Peak memory consumption was 3.7 GB. Max. memory is 8.0 GB. [2021-06-12 17:09:24,422 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-12 17:09:24,422 INFO L168 Benchmark]: CACSL2BoogieTranslator took 588.98 ms. Allocated memory is still 255.9 MB. Free memory was 218.7 MB in the beginning and 213.4 MB in the end (delta: 5.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-06-12 17:09:24,422 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.83 ms. Allocated memory is still 255.9 MB. Free memory was 213.4 MB in the beginning and 210.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-12 17:09:24,422 INFO L168 Benchmark]: Boogie Preprocessor took 47.56 ms. Allocated memory is still 255.9 MB. Free memory was 210.3 MB in the beginning and 208.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-12 17:09:24,423 INFO L168 Benchmark]: RCFGBuilder took 2020.47 ms. Allocated memory is still 255.9 MB. Free memory was 208.2 MB in the beginning and 100.3 MB in the end (delta: 107.9 MB). Peak memory consumption was 123.6 MB. Max. memory is 8.0 GB. [2021-06-12 17:09:24,423 INFO L168 Benchmark]: TraceAbstraction took 139741.33 ms. Allocated memory was 255.9 MB in the beginning and 7.9 GB in the end (delta: 7.6 GB). Free memory was 99.8 MB in the beginning and 4.5 GB in the end (delta: -4.4 GB). Peak memory consumption was 3.6 GB. Max. memory is 8.0 GB. [2021-06-12 17:09:24,425 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 588.98 ms. Allocated memory is still 255.9 MB. Free memory was 218.7 MB in the beginning and 213.4 MB in the end (delta: 5.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 77.83 ms. Allocated memory is still 255.9 MB. Free memory was 213.4 MB in the beginning and 210.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 47.56 ms. Allocated memory is still 255.9 MB. Free memory was 210.3 MB in the beginning and 208.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2020.47 ms. Allocated memory is still 255.9 MB. Free memory was 208.2 MB in the beginning and 100.3 MB in the end (delta: 107.9 MB). Peak memory consumption was 123.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 139741.33 ms. Allocated memory was 255.9 MB in the beginning and 7.9 GB in the end (delta: 7.6 GB). Free memory was 99.8 MB in the beginning and 4.5 GB in the end (delta: -4.4 GB). Peak memory consumption was 3.6 GB. 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L722] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L723] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L724] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L725] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L726] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L727] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0] [L728] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0] [L729] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L730] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L731] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L732] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0] [L733] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0] [L734] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L735] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L736] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L737] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L738] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L740] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L742] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L743] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L744] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L846] 0 pthread_t t1481; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t1481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t1482; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t1482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t1483; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L768] 2 x$w_buff1 = x$w_buff0 [L769] 2 x$w_buff0 = 2 [L770] 2 x$w_buff1_used = x$w_buff0_used [L771] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L773] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L774] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L775] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L776] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L777] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L778] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t1483, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L798] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L852] 0 pthread_t t1484; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L804] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L804] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L804] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L804] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L805] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L805] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L806] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L807] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L808] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L853] FCALL, FORK 0 pthread_create(&t1484, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L818] 4 z = 2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L824] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L824] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L824] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L825] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L825] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L826] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L826] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L827] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L827] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L828] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L828] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L748] 1 a = 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L751] 1 x = 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L784] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L785] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L785] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L786] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L787] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L788] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L754] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L754] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L755] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L758] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L861] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L863] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 x$flush_delayed = weak$$choice2 [L869] 0 x$mem_tmp = x [L870] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L870] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L871] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L871] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L871] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L872] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L872] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L872] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L873] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L873] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L873] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L875] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L875] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L878] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L878] 0 x = x$flush_delayed ? x$mem_tmp : x [L879] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1 with 1 thread instances CFG has 9 procedures, 163 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 32413.2ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 1420.5ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 30989.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=138267occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1Thread1of1ForFork3 with 1 thread instances CFG has 9 procedures, 163 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 33251.0ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 236.6ms, AutomataDifference: 2352.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 30326.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 113 SDtfs, 57 SDslu, 90 SDs, 0 SdLazy, 13 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 33.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=138267occurred 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: 7.7ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 10.0ms SsaConstructionTime, 61.6ms SatisfiabilityAnalysisTime, 159.6ms InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 95 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 9 procedures, 163 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 73718.8ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 1808.4ms, AutomataDifference: 16594.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 29415.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2852 SDtfs, 5546 SDslu, 12223 SDs, 0 SdLazy, 1609 SolverSat, 406 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1642.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 3213.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=138267occurred in iteration=0, InterpolantAutomatonStates: 175, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 22068.1ms AutomataMinimizationTime, 15 MinimizatonAttempts, 21214 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 56.6ms SsaConstructionTime, 667.3ms SatisfiabilityAnalysisTime, 2827.3ms InterpolantComputationTime, 1418 NumberOfCodeBlocks, 1418 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1305 ConstructedInterpolants, 0 QuantifiedInterpolants, 9096 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...