/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/mix033_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-a47a088281b0b97d17910950432b7c5b5bc3adeb-a47a088 [2021-07-13 18:41:48,742 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-13 18:41:48,744 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-13 18:41:48,768 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-13 18:41:48,769 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-13 18:41:48,769 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-13 18:41:48,770 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-13 18:41:48,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-13 18:41:48,773 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-13 18:41:48,773 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-13 18:41:48,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-13 18:41:48,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-13 18:41:48,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-13 18:41:48,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-13 18:41:48,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-13 18:41:48,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-13 18:41:48,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-13 18:41:48,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-13 18:41:48,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-13 18:41:48,781 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-13 18:41:48,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-13 18:41:48,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-13 18:41:48,791 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-13 18:41:48,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-13 18:41:48,793 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-13 18:41:48,794 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-13 18:41:48,794 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-13 18:41:48,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-13 18:41:48,795 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-13 18:41:48,795 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-13 18:41:48,795 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-13 18:41:48,796 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-13 18:41:48,797 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-13 18:41:48,797 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-13 18:41:48,798 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-13 18:41:48,798 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-13 18:41:48,799 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-13 18:41:48,799 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-13 18:41:48,799 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-13 18:41:48,800 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-13 18:41:48,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-13 18:41:48,801 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-07-13 18:41:48,820 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-13 18:41:48,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-13 18:41:48,821 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-07-13 18:41:48,821 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-07-13 18:41:48,822 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-13 18:41:48,822 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-13 18:41:48,822 INFO L138 SettingsManager]: * Use SBE=true [2021-07-13 18:41:48,822 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-13 18:41:48,822 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-13 18:41:48,823 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-13 18:41:48,823 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-13 18:41:48,823 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-13 18:41:48,823 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-13 18:41:48,823 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-13 18:41:48,823 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-13 18:41:48,823 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-13 18:41:48,824 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-13 18:41:48,824 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-13 18:41:48,824 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-13 18:41:48,824 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-13 18:41:48,824 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-13 18:41:48,824 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-13 18:41:48,825 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-13 18:41:48,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-13 18:41:48,825 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-13 18:41:48,825 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-13 18:41:48,825 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-13 18:41:48,825 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-13 18:41:48,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-13 18:41:48,826 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-13 18:41:48,826 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-13 18:41:48,826 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-07-13 18:41:49,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-13 18:41:49,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-13 18:41:49,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-13 18:41:49,117 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-13 18:41:49,119 INFO L275 PluginConnector]: CDTParser initialized [2021-07-13 18:41:49,120 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2021-07-13 18:41:49,172 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89704b83e/c949ccbc7b7d4743a0ec481368525bd8/FLAGcfb7d665f [2021-07-13 18:41:49,593 INFO L306 CDTParser]: Found 1 translation units. [2021-07-13 18:41:49,593 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2021-07-13 18:41:49,604 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89704b83e/c949ccbc7b7d4743a0ec481368525bd8/FLAGcfb7d665f [2021-07-13 18:41:49,937 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89704b83e/c949ccbc7b7d4743a0ec481368525bd8 [2021-07-13 18:41:49,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-13 18:41:49,940 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-13 18:41:49,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-13 18:41:49,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-13 18:41:49,943 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-13 18:41:49,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:41:49" (1/1) ... [2021-07-13 18:41:49,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@509e417d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:41:49, skipping insertion in model container [2021-07-13 18:41:49,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:41:49" (1/1) ... [2021-07-13 18:41:49,949 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-13 18:41:49,979 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-13 18:41:50,081 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/mix033_tso.oepc.i[949,962] [2021-07-13 18:41:50,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-13 18:41:50,287 INFO L203 MainTranslator]: Completed pre-run [2021-07-13 18:41:50,295 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/mix033_tso.oepc.i[949,962] [2021-07-13 18:41:50,317 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-13 18:41:50,354 INFO L208 MainTranslator]: Completed translation [2021-07-13 18:41:50,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:41:50 WrapperNode [2021-07-13 18:41:50,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-13 18:41:50,360 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-13 18:41:50,360 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-13 18:41:50,360 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-13 18:41:50,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:41:50" (1/1) ... [2021-07-13 18:41:50,395 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:41:50" (1/1) ... [2021-07-13 18:41:50,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-13 18:41:50,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-13 18:41:50,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-13 18:41:50,416 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-13 18:41:50,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:41:50" (1/1) ... [2021-07-13 18:41:50,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:41:50" (1/1) ... [2021-07-13 18:41:50,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:41:50" (1/1) ... [2021-07-13 18:41:50,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:41:50" (1/1) ... [2021-07-13 18:41:50,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:41:50" (1/1) ... [2021-07-13 18:41:50,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:41:50" (1/1) ... [2021-07-13 18:41:50,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:41:50" (1/1) ... [2021-07-13 18:41:50,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-13 18:41:50,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-13 18:41:50,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-13 18:41:50,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-13 18:41:50,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:41:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-13 18:41:50,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-13 18:41:50,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-07-13 18:41:50,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-13 18:41:50,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-13 18:41:50,499 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-07-13 18:41:50,501 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-07-13 18:41:50,501 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-07-13 18:41:50,501 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-07-13 18:41:50,501 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-07-13 18:41:50,501 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-07-13 18:41:50,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-13 18:41:50,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-07-13 18:41:50,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-13 18:41:50,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-13 18:41:50,503 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-13 18:41:52,040 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-13 18:41:52,040 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-07-13 18:41:52,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:41:52 BoogieIcfgContainer [2021-07-13 18:41:52,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-13 18:41:52,043 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-13 18:41:52,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-13 18:41:52,045 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-13 18:41:52,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 06:41:49" (1/3) ... [2021-07-13 18:41:52,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f456e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:41:52, skipping insertion in model container [2021-07-13 18:41:52,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:41:50" (2/3) ... [2021-07-13 18:41:52,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f456e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:41:52, skipping insertion in model container [2021-07-13 18:41:52,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:41:52" (3/3) ... [2021-07-13 18:41:52,047 INFO L111 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2021-07-13 18:41:52,051 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-13 18:41:52,051 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-13 18:41:52,051 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-13 18:41:52,052 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-13 18:41:52,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,073 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,073 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,073 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,073 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,075 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,075 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,075 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,075 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,075 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,075 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,076 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,076 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,076 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,076 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,076 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,077 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,077 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,077 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,080 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,080 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,080 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,080 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,083 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,084 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,084 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,085 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,086 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,086 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,088 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,088 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:41:52,090 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-07-13 18:41:52,104 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-13 18:41:52,116 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-13 18:41:52,116 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-13 18:41:52,116 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-13 18:41:52,116 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-13 18:41:52,116 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-13 18:41:52,116 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-13 18:41:52,116 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-13 18:41:52,117 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1Thread1of1ForFork0======== [2021-07-13 18:41:52,134 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 123 places, 115 transitions, 245 flow [2021-07-13 18:41:52,307 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6748 states, 6746 states have (on average 3.4269196560924993) internal successors, (23118), 6747 states have internal predecessors, (23118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:52,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 6748 states, 6746 states have (on average 3.4269196560924993) internal successors, (23118), 6747 states have internal predecessors, (23118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:52,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-07-13 18:41:52,332 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:41:52,333 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:41:52,333 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:41:52,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:41:52,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1307067091, now seen corresponding path program 1 times [2021-07-13 18:41:52,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:41:52,350 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559440359] [2021-07-13 18:41:52,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:41:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:41:52,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:41:52,579 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:41:52,579 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559440359] [2021-07-13 18:41:52,581 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559440359] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:41:52,581 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:41:52,581 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-13 18:41:52,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484639156] [2021-07-13 18:41:52,584 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-13 18:41:52,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:41:52,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-13 18:41:52,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 18:41:52,622 INFO L87 Difference]: Start difference. First operand has 6748 states, 6746 states have (on average 3.4269196560924993) internal successors, (23118), 6747 states have internal predecessors, (23118), 0 states have call successors, (0), 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.5) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:52,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:41:52,705 INFO L93 Difference]: Finished difference Result 4372 states and 13879 transitions. [2021-07-13 18:41:52,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-13 18:41:52,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2021-07-13 18:41:52,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:41:52,711 INFO L225 Difference]: With dead ends: 4372 [2021-07-13 18:41:52,711 INFO L226 Difference]: Without dead ends: 0 [2021-07-13 18:41:52,712 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 18:41:52,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-13 18:41:52,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-13 18:41:52,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:52,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-13 18:41:52,727 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2021-07-13 18:41:52,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:41:52,727 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-13 18:41:52,727 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:52,727 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-13 18:41:52,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-13 18:41:52,728 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-13 18:41:52,729 INFO L301 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork0 was SAFE (1/2) [2021-07-13 18:41:52,730 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-07-13 18:41:52,734 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-13 18:41:52,734 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-13 18:41:52,734 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-13 18:41:52,734 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-13 18:41:52,734 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-13 18:41:52,734 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-13 18:41:52,734 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-13 18:41:52,734 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-13 18:41:52,737 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 123 places, 115 transitions, 245 flow [2021-07-13 18:41:53,039 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14796 states, 14794 states have (on average 3.632283358118156) internal successors, (53736), 14795 states have internal predecessors, (53736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 14796 states, 14794 states have (on average 3.632283358118156) internal successors, (53736), 14795 states have internal predecessors, (53736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:53,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-07-13 18:41:53,094 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:41:53,094 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:41:53,094 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:41:53,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:41:53,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1095003396, now seen corresponding path program 1 times [2021-07-13 18:41:53,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:41:53,100 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928926836] [2021-07-13 18:41:53,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:41:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:41:53,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:41:53,307 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:41:53,307 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928926836] [2021-07-13 18:41:53,308 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928926836] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:41:53,308 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:41:53,308 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-13 18:41:53,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939505078] [2021-07-13 18:41:53,309 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-13 18:41:53,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:41:53,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-13 18:41:53,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-13 18:41:53,338 INFO L87 Difference]: Start difference. First operand has 14796 states, 14794 states have (on average 3.632283358118156) internal successors, (53736), 14795 states have internal predecessors, (53736), 0 states have call successors, (0), 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 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:53,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:41:53,722 INFO L93 Difference]: Finished difference Result 15916 states and 56284 transitions. [2021-07-13 18:41:53,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-13 18:41:53,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2021-07-13 18:41:53,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:41:53,823 INFO L225 Difference]: With dead ends: 15916 [2021-07-13 18:41:53,824 INFO L226 Difference]: Without dead ends: 10740 [2021-07-13 18:41:53,824 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 87.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:41:53,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10740 states. [2021-07-13 18:41:54,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10740 to 10740. [2021-07-13 18:41:54,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10740 states, 10739 states have (on average 3.5156904739733683) internal successors, (37755), 10739 states have internal predecessors, (37755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:54,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10740 states to 10740 states and 37755 transitions. [2021-07-13 18:41:54,315 INFO L78 Accepts]: Start accepts. Automaton has 10740 states and 37755 transitions. Word has length 72 [2021-07-13 18:41:54,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:41:54,316 INFO L482 AbstractCegarLoop]: Abstraction has 10740 states and 37755 transitions. [2021-07-13 18:41:54,316 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:54,316 INFO L276 IsEmpty]: Start isEmpty. Operand 10740 states and 37755 transitions. [2021-07-13 18:41:54,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-13 18:41:54,337 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:41:54,338 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:41:54,338 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-13 18:41:54,338 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:41:54,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:41:54,339 INFO L82 PathProgramCache]: Analyzing trace with hash 259445631, now seen corresponding path program 1 times [2021-07-13 18:41:54,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:41:54,340 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16272455] [2021-07-13 18:41:54,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:41:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:41:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:41:54,457 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:41:54,457 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16272455] [2021-07-13 18:41:54,457 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16272455] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:41:54,457 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:41:54,457 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-13 18:41:54,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201275692] [2021-07-13 18:41:54,458 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-13 18:41:54,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:41:54,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-13 18:41:54,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-13 18:41:54,459 INFO L87 Difference]: Start difference. First operand 10740 states and 37755 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:54,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:41:54,696 INFO L93 Difference]: Finished difference Result 11508 states and 40123 transitions. [2021-07-13 18:41:54,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-13 18:41:54,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-07-13 18:41:54,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:41:54,760 INFO L225 Difference]: With dead ends: 11508 [2021-07-13 18:41:54,761 INFO L226 Difference]: Without dead ends: 9588 [2021-07-13 18:41:54,761 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 84.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:41:54,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9588 states. [2021-07-13 18:41:55,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9588 to 9588. [2021-07-13 18:41:55,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9588 states, 9587 states have (on average 3.4925419839365808) internal successors, (33483), 9587 states have internal predecessors, (33483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:55,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9588 states to 9588 states and 33483 transitions. [2021-07-13 18:41:55,100 INFO L78 Accepts]: Start accepts. Automaton has 9588 states and 33483 transitions. Word has length 76 [2021-07-13 18:41:55,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:41:55,100 INFO L482 AbstractCegarLoop]: Abstraction has 9588 states and 33483 transitions. [2021-07-13 18:41:55,100 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:55,100 INFO L276 IsEmpty]: Start isEmpty. Operand 9588 states and 33483 transitions. [2021-07-13 18:41:55,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-07-13 18:41:55,116 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:41:55,117 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:41:55,117 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-13 18:41:55,117 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:41:55,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:41:55,118 INFO L82 PathProgramCache]: Analyzing trace with hash -405627423, now seen corresponding path program 1 times [2021-07-13 18:41:55,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:41:55,118 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627892422] [2021-07-13 18:41:55,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:41:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:41:55,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:41:55,362 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:41:55,362 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627892422] [2021-07-13 18:41:55,362 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627892422] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:41:55,362 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:41:55,362 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-13 18:41:55,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246509378] [2021-07-13 18:41:55,363 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-13 18:41:55,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:41:55,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-13 18:41:55,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-07-13 18:41:55,366 INFO L87 Difference]: Start difference. First operand 9588 states and 33483 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 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-07-13 18:41:55,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:41:55,770 INFO L93 Difference]: Finished difference Result 11196 states and 38931 transitions. [2021-07-13 18:41:55,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-07-13 18:41:55,771 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 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-07-13 18:41:55,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:41:55,805 INFO L225 Difference]: With dead ends: 11196 [2021-07-13 18:41:55,806 INFO L226 Difference]: Without dead ends: 9948 [2021-07-13 18:41:55,806 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 236.7ms TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2021-07-13 18:41:55,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9948 states. [2021-07-13 18:41:56,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9948 to 9948. [2021-07-13 18:41:56,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9948 states, 9947 states have (on average 3.4952246908615665) internal successors, (34767), 9947 states have internal predecessors, (34767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:56,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9948 states to 9948 states and 34767 transitions. [2021-07-13 18:41:56,148 INFO L78 Accepts]: Start accepts. Automaton has 9948 states and 34767 transitions. Word has length 80 [2021-07-13 18:41:56,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:41:56,148 INFO L482 AbstractCegarLoop]: Abstraction has 9948 states and 34767 transitions. [2021-07-13 18:41:56,148 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 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-07-13 18:41:56,148 INFO L276 IsEmpty]: Start isEmpty. Operand 9948 states and 34767 transitions. [2021-07-13 18:41:56,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-07-13 18:41:56,166 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:41:56,166 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:41:56,166 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-13 18:41:56,166 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:41:56,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:41:56,167 INFO L82 PathProgramCache]: Analyzing trace with hash 2085094760, now seen corresponding path program 1 times [2021-07-13 18:41:56,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:41:56,167 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365798720] [2021-07-13 18:41:56,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:41:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:41:56,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:41:56,405 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:41:56,405 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365798720] [2021-07-13 18:41:56,405 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365798720] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:41:56,405 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:41:56,405 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-13 18:41:56,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793337758] [2021-07-13 18:41:56,406 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-13 18:41:56,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:41:56,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-13 18:41:56,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-07-13 18:41:56,407 INFO L87 Difference]: Start difference. First operand 9948 states and 34767 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-07-13 18:41:56,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:41:56,748 INFO L93 Difference]: Finished difference Result 10572 states and 36715 transitions. [2021-07-13 18:41:56,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-07-13 18:41:56,749 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-07-13 18:41:56,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:41:56,785 INFO L225 Difference]: With dead ends: 10572 [2021-07-13 18:41:56,785 INFO L226 Difference]: Without dead ends: 9804 [2021-07-13 18:41:56,785 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 228.1ms TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2021-07-13 18:41:56,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9804 states. [2021-07-13 18:41:57,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9804 to 9372. [2021-07-13 18:41:57,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9372 states, 9371 states have (on average 3.4846867997012057) internal successors, (32655), 9371 states have internal predecessors, (32655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:57,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9372 states to 9372 states and 32655 transitions. [2021-07-13 18:41:57,139 INFO L78 Accepts]: Start accepts. Automaton has 9372 states and 32655 transitions. Word has length 82 [2021-07-13 18:41:57,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:41:57,139 INFO L482 AbstractCegarLoop]: Abstraction has 9372 states and 32655 transitions. [2021-07-13 18:41:57,139 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-07-13 18:41:57,139 INFO L276 IsEmpty]: Start isEmpty. Operand 9372 states and 32655 transitions. [2021-07-13 18:41:57,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-07-13 18:41:57,160 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:41:57,160 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:41:57,160 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-13 18:41:57,160 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:41:57,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:41:57,161 INFO L82 PathProgramCache]: Analyzing trace with hash -366017182, now seen corresponding path program 1 times [2021-07-13 18:41:57,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:41:57,161 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833029118] [2021-07-13 18:41:57,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:41:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:41:57,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-07-13 18:41:57,290 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:41:57,291 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833029118] [2021-07-13 18:41:57,291 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833029118] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:41:57,291 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:41:57,291 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-13 18:41:57,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121726977] [2021-07-13 18:41:57,292 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-13 18:41:57,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:41:57,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-13 18:41:57,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-13 18:41:57,293 INFO L87 Difference]: Start difference. First operand 9372 states and 32655 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 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-07-13 18:41:57,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:41:57,413 INFO L93 Difference]: Finished difference Result 14040 states and 48591 transitions. [2021-07-13 18:41:57,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-13 18:41:57,414 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 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-07-13 18:41:57,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:41:57,440 INFO L225 Difference]: With dead ends: 14040 [2021-07-13 18:41:57,441 INFO L226 Difference]: Without dead ends: 10272 [2021-07-13 18:41:57,441 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 56.5ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:41:57,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10272 states. [2021-07-13 18:41:57,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10272 to 9372. [2021-07-13 18:41:57,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9372 states, 9371 states have (on average 3.423220574111621) internal successors, (32079), 9371 states have internal predecessors, (32079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:57,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9372 states to 9372 states and 32079 transitions. [2021-07-13 18:41:57,719 INFO L78 Accepts]: Start accepts. Automaton has 9372 states and 32079 transitions. Word has length 82 [2021-07-13 18:41:57,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:41:57,720 INFO L482 AbstractCegarLoop]: Abstraction has 9372 states and 32079 transitions. [2021-07-13 18:41:57,720 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 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-07-13 18:41:57,720 INFO L276 IsEmpty]: Start isEmpty. Operand 9372 states and 32079 transitions. [2021-07-13 18:41:57,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-07-13 18:41:57,735 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:41:57,735 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:41:57,735 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-13 18:41:57,736 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:41:57,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:41:57,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1419749554, now seen corresponding path program 2 times [2021-07-13 18:41:57,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:41:57,736 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056982956] [2021-07-13 18:41:57,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:41:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:41:57,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:41:57,803 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:41:57,803 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056982956] [2021-07-13 18:41:57,803 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056982956] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:41:57,804 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:41:57,804 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-13 18:41:57,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53661943] [2021-07-13 18:41:57,804 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-13 18:41:57,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:41:57,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-13 18:41:57,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-13 18:41:57,805 INFO L87 Difference]: Start difference. First operand 9372 states and 32079 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 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-07-13 18:41:57,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:41:57,918 INFO L93 Difference]: Finished difference Result 10940 states and 36650 transitions. [2021-07-13 18:41:57,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-13 18:41:57,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 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-07-13 18:41:57,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:41:57,942 INFO L225 Difference]: With dead ends: 10940 [2021-07-13 18:41:57,942 INFO L226 Difference]: Without dead ends: 7740 [2021-07-13 18:41:57,942 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 61.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:41:57,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7740 states. [2021-07-13 18:41:58,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7740 to 7740. [2021-07-13 18:41:58,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7740 states, 7739 states have (on average 3.3209717017702545) internal successors, (25701), 7739 states have internal predecessors, (25701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:58,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7740 states to 7740 states and 25701 transitions. [2021-07-13 18:41:58,244 INFO L78 Accepts]: Start accepts. Automaton has 7740 states and 25701 transitions. Word has length 82 [2021-07-13 18:41:58,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:41:58,245 INFO L482 AbstractCegarLoop]: Abstraction has 7740 states and 25701 transitions. [2021-07-13 18:41:58,245 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 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-07-13 18:41:58,245 INFO L276 IsEmpty]: Start isEmpty. Operand 7740 states and 25701 transitions. [2021-07-13 18:41:58,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-07-13 18:41:58,267 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:41:58,267 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:41:58,267 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-13 18:41:58,267 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:41:58,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:41:58,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1980597774, now seen corresponding path program 1 times [2021-07-13 18:41:58,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:41:58,268 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709544155] [2021-07-13 18:41:58,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:41:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:41:58,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:41:58,334 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:41:58,334 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709544155] [2021-07-13 18:41:58,336 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709544155] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:41:58,336 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:41:58,336 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-13 18:41:58,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006094147] [2021-07-13 18:41:58,336 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-13 18:41:58,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:41:58,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-13 18:41:58,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-13 18:41:58,337 INFO L87 Difference]: Start difference. First operand 7740 states and 25701 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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-07-13 18:41:58,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:41:58,453 INFO L93 Difference]: Finished difference Result 7224 states and 23335 transitions. [2021-07-13 18:41:58,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-13 18:41:58,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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-07-13 18:41:58,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:41:58,465 INFO L225 Difference]: With dead ends: 7224 [2021-07-13 18:41:58,465 INFO L226 Difference]: Without dead ends: 5004 [2021-07-13 18:41:58,465 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 74.2ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-07-13 18:41:58,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5004 states. [2021-07-13 18:41:58,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5004 to 5004. [2021-07-13 18:41:58,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5004 states, 5003 states have (on average 3.167899260443734) internal successors, (15849), 5003 states have internal predecessors, (15849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:58,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5004 states to 5004 states and 15849 transitions. [2021-07-13 18:41:58,559 INFO L78 Accepts]: Start accepts. Automaton has 5004 states and 15849 transitions. Word has length 83 [2021-07-13 18:41:58,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:41:58,559 INFO L482 AbstractCegarLoop]: Abstraction has 5004 states and 15849 transitions. [2021-07-13 18:41:58,559 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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-07-13 18:41:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand 5004 states and 15849 transitions. [2021-07-13 18:41:58,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-07-13 18:41:58,567 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:41:58,567 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:41:58,567 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-13 18:41:58,567 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:41:58,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:41:58,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1237055120, now seen corresponding path program 1 times [2021-07-13 18:41:58,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:41:58,568 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802895248] [2021-07-13 18:41:58,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:41:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:41:58,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:41:58,664 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:41:58,664 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802895248] [2021-07-13 18:41:58,664 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802895248] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:41:58,664 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:41:58,664 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-13 18:41:58,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002988212] [2021-07-13 18:41:58,665 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-13 18:41:58,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:41:58,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-13 18:41:58,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-07-13 18:41:58,665 INFO L87 Difference]: Start difference. First operand 5004 states and 15849 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:58,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:41:58,782 INFO L93 Difference]: Finished difference Result 4176 states and 13044 transitions. [2021-07-13 18:41:58,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-13 18:41:58,782 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2021-07-13 18:41:58,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:41:58,788 INFO L225 Difference]: With dead ends: 4176 [2021-07-13 18:41:58,788 INFO L226 Difference]: Without dead ends: 2424 [2021-07-13 18:41:58,788 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 84.6ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-07-13 18:41:58,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2021-07-13 18:41:58,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 2424. [2021-07-13 18:41:58,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2424 states, 2423 states have (on average 3.0107304993809327) internal successors, (7295), 2423 states have internal predecessors, (7295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:58,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2424 states and 7295 transitions. [2021-07-13 18:41:58,903 INFO L78 Accepts]: Start accepts. Automaton has 2424 states and 7295 transitions. Word has length 86 [2021-07-13 18:41:58,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:41:58,904 INFO L482 AbstractCegarLoop]: Abstraction has 2424 states and 7295 transitions. [2021-07-13 18:41:58,904 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:58,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 7295 transitions. [2021-07-13 18:41:58,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-07-13 18:41:58,908 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:41:58,908 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:41:58,908 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-13 18:41:58,908 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:41:58,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:41:58,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1829518502, now seen corresponding path program 1 times [2021-07-13 18:41:58,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:41:58,909 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656439875] [2021-07-13 18:41:58,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:41:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:41:59,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:41:59,056 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:41:59,056 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656439875] [2021-07-13 18:41:59,056 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656439875] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:41:59,056 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:41:59,056 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-13 18:41:59,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621150941] [2021-07-13 18:41:59,056 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-13 18:41:59,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:41:59,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-13 18:41:59,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-07-13 18:41:59,057 INFO L87 Difference]: Start difference. First operand 2424 states and 7295 transitions. Second operand has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:59,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:41:59,250 INFO L93 Difference]: Finished difference Result 3144 states and 9500 transitions. [2021-07-13 18:41:59,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-13 18:41:59,251 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2021-07-13 18:41:59,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:41:59,254 INFO L225 Difference]: With dead ends: 3144 [2021-07-13 18:41:59,254 INFO L226 Difference]: Without dead ends: 1332 [2021-07-13 18:41:59,254 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 146.5ms TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-07-13 18:41:59,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2021-07-13 18:41:59,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1332. [2021-07-13 18:41:59,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1331 states have (on average 2.902329075882795) internal successors, (3863), 1331 states have internal predecessors, (3863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 3863 transitions. [2021-07-13 18:41:59,271 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 3863 transitions. Word has length 91 [2021-07-13 18:41:59,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:41:59,272 INFO L482 AbstractCegarLoop]: Abstraction has 1332 states and 3863 transitions. [2021-07-13 18:41:59,272 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:59,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 3863 transitions. [2021-07-13 18:41:59,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-07-13 18:41:59,274 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:41:59,274 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:41:59,274 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-13 18:41:59,274 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:41:59,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:41:59,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1151596466, now seen corresponding path program 2 times [2021-07-13 18:41:59,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:41:59,275 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024066753] [2021-07-13 18:41:59,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:41:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:41:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:41:59,473 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:41:59,473 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024066753] [2021-07-13 18:41:59,473 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024066753] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:41:59,474 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:41:59,474 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-13 18:41:59,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133859871] [2021-07-13 18:41:59,474 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-13 18:41:59,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:41:59,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-13 18:41:59,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-07-13 18:41:59,475 INFO L87 Difference]: Start difference. First operand 1332 states and 3863 transitions. Second operand has 13 states, 13 states have (on average 7.0) internal successors, (91), 13 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:59,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:41:59,625 INFO L93 Difference]: Finished difference Result 1902 states and 5578 transitions. [2021-07-13 18:41:59,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-13 18:41:59,625 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 13 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2021-07-13 18:41:59,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:41:59,627 INFO L225 Difference]: With dead ends: 1902 [2021-07-13 18:41:59,627 INFO L226 Difference]: Without dead ends: 976 [2021-07-13 18:41:59,628 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 167.7ms TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-07-13 18:41:59,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2021-07-13 18:41:59,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2021-07-13 18:41:59,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 2.7887179487179488) internal successors, (2719), 975 states have internal predecessors, (2719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:59,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 2719 transitions. [2021-07-13 18:41:59,641 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 2719 transitions. Word has length 91 [2021-07-13 18:41:59,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:41:59,641 INFO L482 AbstractCegarLoop]: Abstraction has 976 states and 2719 transitions. [2021-07-13 18:41:59,641 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 13 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:41:59,642 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 2719 transitions. [2021-07-13 18:41:59,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-07-13 18:41:59,643 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:41:59,643 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:41:59,643 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-07-13 18:41:59,643 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:41:59,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:41:59,644 INFO L82 PathProgramCache]: Analyzing trace with hash -893515698, now seen corresponding path program 3 times [2021-07-13 18:41:59,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:41:59,644 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552321719] [2021-07-13 18:41:59,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:41:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-13 18:41:59,671 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-13 18:41:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-13 18:41:59,701 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-13 18:41:59,728 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-13 18:41:59,729 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-13 18:41:59,729 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-07-13 18:41:59,729 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2021-07-13 18:41:59,730 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-13 18:41:59,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 06:41:59 BasicIcfg [2021-07-13 18:41:59,844 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-13 18:41:59,845 INFO L168 Benchmark]: Toolchain (without parser) took 9905.23 ms. Allocated memory was 181.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 144.2 MB in the beginning and 2.2 GB in the end (delta: -2.0 GB). Peak memory consumption was 689.2 MB. Max. memory is 8.0 GB. [2021-07-13 18:41:59,845 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 181.4 MB. Free memory is still 162.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-13 18:41:59,845 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.76 ms. Allocated memory is still 181.4 MB. Free memory was 143.9 MB in the beginning and 151.5 MB in the end (delta: -7.6 MB). Peak memory consumption was 10.3 MB. Max. memory is 8.0 GB. [2021-07-13 18:41:59,845 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.53 ms. Allocated memory is still 181.4 MB. Free memory was 151.5 MB in the beginning and 148.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-07-13 18:41:59,845 INFO L168 Benchmark]: Boogie Preprocessor took 20.07 ms. Allocated memory is still 181.4 MB. Free memory was 148.5 MB in the beginning and 146.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-13 18:41:59,846 INFO L168 Benchmark]: RCFGBuilder took 1605.32 ms. Allocated memory was 181.4 MB in the beginning and 218.1 MB in the end (delta: 36.7 MB). Free memory was 146.4 MB in the beginning and 121.3 MB in the end (delta: 25.1 MB). Peak memory consumption was 88.0 MB. Max. memory is 8.0 GB. [2021-07-13 18:41:59,846 INFO L168 Benchmark]: TraceAbstraction took 7801.25 ms. Allocated memory was 218.1 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 120.8 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 629.5 MB. Max. memory is 8.0 GB. [2021-07-13 18:41:59,846 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 181.4 MB. Free memory is still 162.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 418.76 ms. Allocated memory is still 181.4 MB. Free memory was 143.9 MB in the beginning and 151.5 MB in the end (delta: -7.6 MB). Peak memory consumption was 10.3 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 55.53 ms. Allocated memory is still 181.4 MB. Free memory was 151.5 MB in the beginning and 148.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 20.07 ms. Allocated memory is still 181.4 MB. Free memory was 148.5 MB in the beginning and 146.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1605.32 ms. Allocated memory was 181.4 MB in the beginning and 218.1 MB in the end (delta: 36.7 MB). Free memory was 146.4 MB in the beginning and 121.3 MB in the end (delta: 25.1 MB). Peak memory consumption was 88.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 7801.25 ms. Allocated memory was 218.1 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 120.8 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 629.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L719] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L721] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0] [L722] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0] [L723] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L725] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L726] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L727] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L728] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L729] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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] [L730] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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] [L731] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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] [L732] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L733] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L734] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L735] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L736] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L737] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L738] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L739] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L740] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L741] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L743] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L746] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L747] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L840] 0 pthread_t t891; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L842] 0 pthread_t t892; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L843] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L844] 0 pthread_t t893; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L845] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 2 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L812] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L815] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L792] 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) [L792] 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) [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 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 [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] 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 [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L757] 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) [L757] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L757] 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) [L757] 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) [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 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 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L761] 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 [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L818] 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) [L818] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L818] 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) [L818] 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) [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] 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 [L821] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L822] 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 [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L851] 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) [L851] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L851] 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) [L851] 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) [L852] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L852] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L853] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L853] 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 [L854] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L854] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L855] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L855] 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 [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 x$flush_delayed = weak$$choice2 [L861] 0 x$mem_tmp = x [L862] 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) [L862] 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) [L863] 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)) [L863] 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)) [L864] 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)) [L864] 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)) [L865] 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)) [L865] 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)) [L866] 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)) [L866] 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)) [L867] 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)) [L867] 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)) [L868] 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)) [L868] 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)) [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L870] 0 x = x$flush_delayed ? x$mem_tmp : x [L871] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1Thread1of1ForFork0 with 1 thread instances CFG has 7 procedures, 146 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 613.8ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 24.7ms, AutomataDifference: 127.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 190.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 96 SDtfs, 44 SDslu, 30 SDs, 0 SdLazy, 4 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=6748occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 6.4ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 9.8ms SsaConstructionTime, 50.7ms SatisfiabilityAnalysisTime, 117.0ms InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 96 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 146 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6995.4ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 183.0ms, AutomataDifference: 2528.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 304.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1487 SDtfs, 2517 SDslu, 5664 SDs, 0 SdLazy, 588 SolverSat, 136 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 540.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1228.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=14796occurred in iteration=0, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2342.2ms AutomataMinimizationTime, 10 MinimizatonAttempts, 1332 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 33.1ms SsaConstructionTime, 374.2ms SatisfiabilityAnalysisTime, 1082.6ms InterpolantComputationTime, 916 NumberOfCodeBlocks, 916 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 815 ConstructedInterpolants, 0 QuantifiedInterpolants, 4395 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...