/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-Delay.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-a47a088281b0b97d17910950432b7c5b5bc3adeb-a47a088 [2021-07-14 00:17:09,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-14 00:17:09,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-14 00:17:09,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-14 00:17:09,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-14 00:17:09,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-14 00:17:09,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-14 00:17:09,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-14 00:17:09,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-14 00:17:09,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-14 00:17:09,917 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-14 00:17:09,918 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-14 00:17:09,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-14 00:17:09,919 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-14 00:17:09,920 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-14 00:17:09,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-14 00:17:09,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-14 00:17:09,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-14 00:17:09,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-14 00:17:09,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-14 00:17:09,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-14 00:17:09,932 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-14 00:17:09,933 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-14 00:17:09,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-14 00:17:09,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-14 00:17:09,937 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-14 00:17:09,937 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-14 00:17:09,938 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-14 00:17:09,939 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-14 00:17:09,939 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-14 00:17:09,940 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-14 00:17:09,941 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-14 00:17:09,941 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-14 00:17:09,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-14 00:17:09,943 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-14 00:17:09,943 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-14 00:17:09,944 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-14 00:17:09,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-14 00:17:09,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-14 00:17:09,953 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-14 00:17:09,954 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-14 00:17:09,957 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-Delay.epf [2021-07-14 00:17:10,007 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-14 00:17:10,007 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-14 00:17:10,009 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-14 00:17:10,009 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-14 00:17:10,009 INFO L138 SettingsManager]: * Use SBE=true [2021-07-14 00:17:10,009 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-14 00:17:10,009 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-14 00:17:10,009 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-14 00:17:10,010 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-14 00:17:10,010 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-14 00:17:10,010 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-14 00:17:10,010 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-14 00:17:10,010 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-14 00:17:10,010 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-14 00:17:10,011 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-14 00:17:10,011 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-14 00:17:10,011 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-14 00:17:10,011 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-14 00:17:10,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-14 00:17:10,011 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-14 00:17:10,011 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-14 00:17:10,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-14 00:17:10,012 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-14 00:17:10,012 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-14 00:17:10,012 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-14 00:17:10,012 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-14 00:17:10,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-14 00:17:10,012 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-14 00:17:10,013 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-14 00:17:10,013 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-07-14 00:17:10,013 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-14 00:17:10,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-14 00:17:10,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-14 00:17:10,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-14 00:17:10,355 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-14 00:17:10,359 INFO L275 PluginConnector]: CDTParser initialized [2021-07-14 00:17:10,360 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i [2021-07-14 00:17:10,416 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a92e60c0/eecb59016c41441b9b1d775b19ac6062/FLAG25b01396c [2021-07-14 00:17:10,932 INFO L306 CDTParser]: Found 1 translation units. [2021-07-14 00:17:10,937 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i [2021-07-14 00:17:10,949 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a92e60c0/eecb59016c41441b9b1d775b19ac6062/FLAG25b01396c [2021-07-14 00:17:11,386 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a92e60c0/eecb59016c41441b9b1d775b19ac6062 [2021-07-14 00:17:11,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-14 00:17:11,397 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-14 00:17:11,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-14 00:17:11,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-14 00:17:11,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-14 00:17:11,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:17:11" (1/1) ... [2021-07-14 00:17:11,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f734bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:17:11, skipping insertion in model container [2021-07-14 00:17:11,406 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:17:11" (1/1) ... [2021-07-14 00:17:11,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-14 00:17:11,463 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-14 00:17:11,569 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/safe010_rmo.oepc.i[950,963] [2021-07-14 00:17:11,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-14 00:17:11,799 INFO L203 MainTranslator]: Completed pre-run [2021-07-14 00:17:11,810 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/safe010_rmo.oepc.i[950,963] [2021-07-14 00:17:11,867 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-14 00:17:11,901 INFO L208 MainTranslator]: Completed translation [2021-07-14 00:17:11,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:17:11 WrapperNode [2021-07-14 00:17:11,901 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-14 00:17:11,902 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-14 00:17:11,902 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-14 00:17:11,902 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-14 00:17:11,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:17:11" (1/1) ... [2021-07-14 00:17:11,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:17:11" (1/1) ... [2021-07-14 00:17:11,957 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-14 00:17:11,957 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-14 00:17:11,957 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-14 00:17:11,958 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-14 00:17:11,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:17:11" (1/1) ... [2021-07-14 00:17:11,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:17:11" (1/1) ... [2021-07-14 00:17:11,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:17:11" (1/1) ... [2021-07-14 00:17:11,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:17:11" (1/1) ... [2021-07-14 00:17:11,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:17:11" (1/1) ... [2021-07-14 00:17:11,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:17:11" (1/1) ... [2021-07-14 00:17:12,000 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:17:11" (1/1) ... [2021-07-14 00:17:12,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-14 00:17:12,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-14 00:17:12,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-14 00:17:12,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-14 00:17:12,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:17:11" (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-14 00:17:12,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-14 00:17:12,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-07-14 00:17:12,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-14 00:17:12,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-14 00:17:12,070 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-07-14 00:17:12,071 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-07-14 00:17:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-07-14 00:17:12,071 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-07-14 00:17:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-14 00:17:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-07-14 00:17:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-14 00:17:12,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-14 00:17:12,073 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-14 00:17:13,623 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-14 00:17:13,624 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-07-14 00:17:13,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:17:13 BoogieIcfgContainer [2021-07-14 00:17:13,625 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-14 00:17:13,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-14 00:17:13,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-14 00:17:13,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-14 00:17:13,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 12:17:11" (1/3) ... [2021-07-14 00:17:13,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e89edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:17:13, skipping insertion in model container [2021-07-14 00:17:13,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:17:11" (2/3) ... [2021-07-14 00:17:13,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e89edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:17:13, skipping insertion in model container [2021-07-14 00:17:13,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:17:13" (3/3) ... [2021-07-14 00:17:13,631 INFO L111 eAbstractionObserver]: Analyzing ICFG safe010_rmo.oepc.i [2021-07-14 00:17:13,637 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-14 00:17:13,637 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-14 00:17:13,637 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-14 00:17:13,638 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-14 00:17:13,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,661 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,661 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,662 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,662 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,662 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,662 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,663 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,663 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,664 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,664 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,664 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,664 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,664 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,664 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,664 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,666 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,666 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,667 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,667 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,671 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,671 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,675 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,675 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,675 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,675 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,676 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-07-14 00:17:13,695 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-07-14 00:17:13,710 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-14 00:17:13,710 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-14 00:17:13,710 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-14 00:17:13,710 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-14 00:17:13,710 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-14 00:17:13,710 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-14 00:17:13,710 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-14 00:17:13,710 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-14 00:17:14,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 1251 states, 1093 states have (on average 1.8032936870997256) internal successors, (1971), 1250 states have internal predecessors, (1971), 0 states have call successors, (0), 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-14 00:17:14,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-07-14 00:17:14,274 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:17:14,275 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] [2021-07-14 00:17:14,275 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:17:14,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:17:14,283 INFO L82 PathProgramCache]: Analyzing trace with hash -580539508, now seen corresponding path program 1 times [2021-07-14 00:17:14,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:17:14,294 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704138328] [2021-07-14 00:17:14,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:17:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:17:14,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:14,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:14,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:14,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:17:14,681 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:17:14,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:17:14,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:14,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:17:14,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:14,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:17:14,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:14,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:14,721 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-14 00:17:14,721 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:17:14,721 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704138328] [2021-07-14 00:17:14,722 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704138328] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:17:14,722 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:17:14,723 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-14 00:17:14,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88153909] [2021-07-14 00:17:14,725 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-14 00:17:14,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:17:14,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-14 00:17:14,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-14 00:17:14,741 INFO L87 Difference]: Start difference. First operand has 1251 states, 1093 states have (on average 1.8032936870997256) internal successors, (1971), 1250 states have internal predecessors, (1971), 0 states have call successors, (0), 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 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 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-14 00:17:14,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:17:14,897 INFO L93 Difference]: Finished difference Result 1431 states and 2295 transitions. [2021-07-14 00:17:14,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-14 00:17:14,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2021-07-14 00:17:14,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:17:14,922 INFO L225 Difference]: With dead ends: 1431 [2021-07-14 00:17:14,922 INFO L226 Difference]: Without dead ends: 657 [2021-07-14 00:17:14,923 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 102.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-14 00:17:14,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2021-07-14 00:17:14,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2021-07-14 00:17:14,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 648 states have (on average 1.8842592592592593) internal successors, (1221), 656 states have internal predecessors, (1221), 0 states have call successors, (0), 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-14 00:17:14,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1221 transitions. [2021-07-14 00:17:14,999 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1221 transitions. Word has length 57 [2021-07-14 00:17:15,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:17:15,000 INFO L482 AbstractCegarLoop]: Abstraction has 657 states and 1221 transitions. [2021-07-14 00:17:15,000 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 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-14 00:17:15,000 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1221 transitions. [2021-07-14 00:17:15,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-07-14 00:17:15,007 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:17:15,008 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] [2021-07-14 00:17:15,008 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-14 00:17:15,008 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:17:15,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:17:15,009 INFO L82 PathProgramCache]: Analyzing trace with hash -8266355, now seen corresponding path program 1 times [2021-07-14 00:17:15,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:17:15,009 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369165277] [2021-07-14 00:17:15,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:17:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:17:15,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:15,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:15,200 INFO L142 QuantifierPusher]: treesize reduction 5, result has 37.5 percent of original size [2021-07-14 00:17:15,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:17:15,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:15,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-07-14 00:17:15,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:15,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-07-14 00:17:15,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:15,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-14 00:17:15,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:15,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-07-14 00:17:15,248 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.8 percent of original size [2021-07-14 00:17:15,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-07-14 00:17:15,298 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:17:15,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:17:15,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:15,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:17:15,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:15,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:17:15,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:15,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:15,393 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-14 00:17:15,393 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:17:15,394 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369165277] [2021-07-14 00:17:15,394 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369165277] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:17:15,394 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:17:15,394 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-14 00:17:15,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063500673] [2021-07-14 00:17:15,395 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-14 00:17:15,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:17:15,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-14 00:17:15,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-07-14 00:17:15,397 INFO L87 Difference]: Start difference. First operand 657 states and 1221 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 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-14 00:17:16,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:17:16,077 INFO L93 Difference]: Finished difference Result 735 states and 1409 transitions. [2021-07-14 00:17:16,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-07-14 00:17:16,078 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2021-07-14 00:17:16,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:17:16,082 INFO L225 Difference]: With dead ends: 735 [2021-07-14 00:17:16,082 INFO L226 Difference]: Without dead ends: 599 [2021-07-14 00:17:16,083 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 531.2ms TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2021-07-14 00:17:16,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-07-14 00:17:16,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 593. [2021-07-14 00:17:16,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 584 states have (on average 1.8613013698630136) internal successors, (1087), 592 states have internal predecessors, (1087), 0 states have call successors, (0), 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-14 00:17:16,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 1087 transitions. [2021-07-14 00:17:16,103 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 1087 transitions. Word has length 59 [2021-07-14 00:17:16,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:17:16,104 INFO L482 AbstractCegarLoop]: Abstraction has 593 states and 1087 transitions. [2021-07-14 00:17:16,104 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 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-14 00:17:16,104 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 1087 transitions. [2021-07-14 00:17:16,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-07-14 00:17:16,106 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:17:16,106 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] [2021-07-14 00:17:16,106 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-14 00:17:16,107 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:17:16,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:17:16,107 INFO L82 PathProgramCache]: Analyzing trace with hash 540746635, now seen corresponding path program 1 times [2021-07-14 00:17:16,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:17:16,108 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043642676] [2021-07-14 00:17:16,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:17:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:17:16,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:16,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:17:16,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:17:16,183 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:17:16,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:17:16,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:17:16,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:17:16,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:16,219 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-14 00:17:16,219 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:17:16,219 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043642676] [2021-07-14 00:17:16,219 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043642676] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:17:16,219 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:17:16,219 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-14 00:17:16,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100490965] [2021-07-14 00:17:16,220 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-14 00:17:16,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:17:16,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-14 00:17:16,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-14 00:17:16,221 INFO L87 Difference]: Start difference. First operand 593 states and 1087 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 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-14 00:17:16,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:17:16,361 INFO L93 Difference]: Finished difference Result 785 states and 1500 transitions. [2021-07-14 00:17:16,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-14 00:17:16,361 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2021-07-14 00:17:16,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:17:16,365 INFO L225 Difference]: With dead ends: 785 [2021-07-14 00:17:16,365 INFO L226 Difference]: Without dead ends: 406 [2021-07-14 00:17:16,367 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 120.4ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-07-14 00:17:16,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-07-14 00:17:16,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2021-07-14 00:17:16,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 401 states have (on average 1.8927680798004987) internal successors, (759), 405 states have internal predecessors, (759), 0 states have call successors, (0), 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-14 00:17:16,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 759 transitions. [2021-07-14 00:17:16,377 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 759 transitions. Word has length 61 [2021-07-14 00:17:16,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:17:16,378 INFO L482 AbstractCegarLoop]: Abstraction has 406 states and 759 transitions. [2021-07-14 00:17:16,378 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 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-14 00:17:16,378 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 759 transitions. [2021-07-14 00:17:16,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-07-14 00:17:16,379 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:17:16,380 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] [2021-07-14 00:17:16,380 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-14 00:17:16,380 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:17:16,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:17:16,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1415038592, now seen corresponding path program 1 times [2021-07-14 00:17:16,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:17:16,381 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159840421] [2021-07-14 00:17:16,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:17:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:17:16,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:16,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:17:16,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:17:16,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-14 00:17:16,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-07-14 00:17:16,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-07-14 00:17:16,544 INFO L142 QuantifierPusher]: treesize reduction 52, result has 52.7 percent of original size [2021-07-14 00:17:16,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 58 [2021-07-14 00:17:16,578 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:17:16,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:17:16,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:17:16,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:17:16,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:16,621 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-14 00:17:16,621 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:17:16,621 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159840421] [2021-07-14 00:17:16,621 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159840421] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:17:16,621 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:17:16,621 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-14 00:17:16,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124879102] [2021-07-14 00:17:16,622 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-14 00:17:16,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:17:16,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-14 00:17:16,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-07-14 00:17:16,623 INFO L87 Difference]: Start difference. First operand 406 states and 759 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 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-14 00:17:16,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:17:16,888 INFO L93 Difference]: Finished difference Result 480 states and 926 transitions. [2021-07-14 00:17:16,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-14 00:17:16,888 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2021-07-14 00:17:16,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:17:16,890 INFO L225 Difference]: With dead ends: 480 [2021-07-14 00:17:16,891 INFO L226 Difference]: Without dead ends: 400 [2021-07-14 00:17:16,891 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 205.9ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-07-14 00:17:16,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-07-14 00:17:16,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2021-07-14 00:17:16,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 395 states have (on average 1.8759493670886076) internal successors, (741), 399 states have internal predecessors, (741), 0 states have call successors, (0), 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-14 00:17:16,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 741 transitions. [2021-07-14 00:17:16,900 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 741 transitions. Word has length 62 [2021-07-14 00:17:16,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:17:16,900 INFO L482 AbstractCegarLoop]: Abstraction has 400 states and 741 transitions. [2021-07-14 00:17:16,901 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 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-14 00:17:16,901 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 741 transitions. [2021-07-14 00:17:16,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-07-14 00:17:16,902 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:17:16,902 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] [2021-07-14 00:17:16,902 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-14 00:17:16,902 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:17:16,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:17:16,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1627661174, now seen corresponding path program 1 times [2021-07-14 00:17:16,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:17:16,903 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656109097] [2021-07-14 00:17:16,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:17:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:17:17,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:17,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:17,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:17,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:17:17,010 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-07-14 00:17:17,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-14 00:17:17,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:17,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:17:17,034 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-07-14 00:17:17,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:17:17,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:17,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:17,045 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-14 00:17:17,045 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:17:17,045 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656109097] [2021-07-14 00:17:17,046 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656109097] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:17:17,046 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:17:17,046 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-14 00:17:17,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409347763] [2021-07-14 00:17:17,046 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-14 00:17:17,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:17:17,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-14 00:17:17,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-14 00:17:17,047 INFO L87 Difference]: Start difference. First operand 400 states and 741 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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-14 00:17:17,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:17:17,131 INFO L93 Difference]: Finished difference Result 424 states and 731 transitions. [2021-07-14 00:17:17,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-14 00:17:17,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2021-07-14 00:17:17,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:17:17,133 INFO L225 Difference]: With dead ends: 424 [2021-07-14 00:17:17,133 INFO L226 Difference]: Without dead ends: 292 [2021-07-14 00:17:17,134 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 80.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-14 00:17:17,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-07-14 00:17:17,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2021-07-14 00:17:17,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 287 states have (on average 1.78397212543554) internal successors, (512), 291 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:17:17,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 512 transitions. [2021-07-14 00:17:17,140 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 512 transitions. Word has length 63 [2021-07-14 00:17:17,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:17:17,140 INFO L482 AbstractCegarLoop]: Abstraction has 292 states and 512 transitions. [2021-07-14 00:17:17,141 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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-14 00:17:17,141 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 512 transitions. [2021-07-14 00:17:17,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-07-14 00:17:17,142 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:17:17,142 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] [2021-07-14 00:17:17,142 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-14 00:17:17,142 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:17:17,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:17:17,142 INFO L82 PathProgramCache]: Analyzing trace with hash 921571041, now seen corresponding path program 1 times [2021-07-14 00:17:17,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:17:17,143 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998699860] [2021-07-14 00:17:17,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:17:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:17:17,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:17,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:17,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:17,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:17:17,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:17,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:17:17,217 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-07-14 00:17:17,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-14 00:17:17,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:17,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:17:17,241 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-07-14 00:17:17,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:17:17,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:17,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:17,254 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-14 00:17:17,254 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:17:17,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998699860] [2021-07-14 00:17:17,254 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998699860] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:17:17,254 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:17:17,254 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-14 00:17:17,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323363269] [2021-07-14 00:17:17,255 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-14 00:17:17,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:17:17,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-14 00:17:17,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-14 00:17:17,256 INFO L87 Difference]: Start difference. First operand 292 states and 512 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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-14 00:17:17,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:17:17,358 INFO L93 Difference]: Finished difference Result 200 states and 292 transitions. [2021-07-14 00:17:17,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-14 00:17:17,358 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2021-07-14 00:17:17,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:17:17,359 INFO L225 Difference]: With dead ends: 200 [2021-07-14 00:17:17,359 INFO L226 Difference]: Without dead ends: 118 [2021-07-14 00:17:17,359 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 95.5ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-07-14 00:17:17,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-07-14 00:17:17,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-07-14 00:17:17,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 115 states have (on average 1.3304347826086957) internal successors, (153), 117 states have internal predecessors, (153), 0 states have call successors, (0), 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-14 00:17:17,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 153 transitions. [2021-07-14 00:17:17,376 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 153 transitions. Word has length 64 [2021-07-14 00:17:17,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:17:17,376 INFO L482 AbstractCegarLoop]: Abstraction has 118 states and 153 transitions. [2021-07-14 00:17:17,376 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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-14 00:17:17,376 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 153 transitions. [2021-07-14 00:17:17,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-07-14 00:17:17,377 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:17:17,377 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-14 00:17:17,377 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-14 00:17:17,377 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:17:17,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:17:17,378 INFO L82 PathProgramCache]: Analyzing trace with hash 45302228, now seen corresponding path program 1 times [2021-07-14 00:17:17,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:17:17,378 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188518894] [2021-07-14 00:17:17,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:17:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:17:17,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:17,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:17,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:17,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:17:17,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:17,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:17:17,504 INFO L142 QuantifierPusher]: treesize reduction 13, result has 71.1 percent of original size [2021-07-14 00:17:17,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-07-14 00:17:17,538 INFO L142 QuantifierPusher]: treesize reduction 29, result has 61.3 percent of original size [2021-07-14 00:17:17,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-07-14 00:17:17,569 INFO L142 QuantifierPusher]: treesize reduction 29, result has 62.8 percent of original size [2021-07-14 00:17:17,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-07-14 00:17:17,605 INFO L142 QuantifierPusher]: treesize reduction 4, result has 89.2 percent of original size [2021-07-14 00:17:17,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-07-14 00:17:17,636 INFO L142 QuantifierPusher]: treesize reduction 30, result has 51.6 percent of original size [2021-07-14 00:17:17,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-07-14 00:17:17,663 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:17:17,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:17:17,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:17,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:17:17,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:17,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:17:17,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:17,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:17,704 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-14 00:17:17,705 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:17:17,705 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188518894] [2021-07-14 00:17:17,705 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188518894] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:17:17,705 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:17:17,705 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-14 00:17:17,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414808646] [2021-07-14 00:17:17,706 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-14 00:17:17,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:17:17,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-14 00:17:17,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-07-14 00:17:17,707 INFO L87 Difference]: Start difference. First operand 118 states and 153 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:17:18,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:17:18,033 INFO L93 Difference]: Finished difference Result 208 states and 288 transitions. [2021-07-14 00:17:18,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-14 00:17:18,033 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-07-14 00:17:18,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:17:18,034 INFO L225 Difference]: With dead ends: 208 [2021-07-14 00:17:18,034 INFO L226 Difference]: Without dead ends: 155 [2021-07-14 00:17:18,035 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 362.4ms TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-07-14 00:17:18,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-07-14 00:17:18,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 106. [2021-07-14 00:17:18,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 103 states have (on average 1.2912621359223302) internal successors, (133), 105 states have internal predecessors, (133), 0 states have call successors, (0), 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-14 00:17:18,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 133 transitions. [2021-07-14 00:17:18,038 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 133 transitions. Word has length 67 [2021-07-14 00:17:18,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:17:18,038 INFO L482 AbstractCegarLoop]: Abstraction has 106 states and 133 transitions. [2021-07-14 00:17:18,038 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:17:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2021-07-14 00:17:18,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-07-14 00:17:18,039 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:17:18,039 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-14 00:17:18,039 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-14 00:17:18,039 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:17:18,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:17:18,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1009408842, now seen corresponding path program 2 times [2021-07-14 00:17:18,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:17:18,040 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971444082] [2021-07-14 00:17:18,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:17:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-14 00:17:18,071 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-14 00:17:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-14 00:17:18,107 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-14 00:17:18,135 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-14 00:17:18,136 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-14 00:17:18,136 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-14 00:17:18,136 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/2) [2021-07-14 00:17:18,138 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-14 00:17:18,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 12:17:18 BasicIcfg [2021-07-14 00:17:18,217 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-14 00:17:18,218 INFO L168 Benchmark]: Toolchain (without parser) took 6820.58 ms. Allocated memory was 223.3 MB in the beginning and 298.8 MB in the end (delta: 75.5 MB). Free memory was 187.1 MB in the beginning and 111.1 MB in the end (delta: 76.0 MB). Peak memory consumption was 153.1 MB. Max. memory is 8.0 GB. [2021-07-14 00:17:18,218 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 223.3 MB. Free memory is still 205.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-14 00:17:18,218 INFO L168 Benchmark]: CACSL2BoogieTranslator took 502.27 ms. Allocated memory is still 223.3 MB. Free memory was 186.9 MB in the beginning and 195.4 MB in the end (delta: -8.5 MB). Peak memory consumption was 14.2 MB. Max. memory is 8.0 GB. [2021-07-14 00:17:18,218 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.59 ms. Allocated memory is still 223.3 MB. Free memory was 195.4 MB in the beginning and 192.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-07-14 00:17:18,219 INFO L168 Benchmark]: Boogie Preprocessor took 45.54 ms. Allocated memory is still 223.3 MB. Free memory was 192.2 MB in the beginning and 190.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-14 00:17:18,219 INFO L168 Benchmark]: RCFGBuilder took 1622.07 ms. Allocated memory is still 223.3 MB. Free memory was 190.1 MB in the beginning and 117.1 MB in the end (delta: 73.0 MB). Peak memory consumption was 117.6 MB. Max. memory is 8.0 GB. [2021-07-14 00:17:18,219 INFO L168 Benchmark]: TraceAbstraction took 4590.30 ms. Allocated memory was 223.3 MB in the beginning and 298.8 MB in the end (delta: 75.5 MB). Free memory was 116.6 MB in the beginning and 111.1 MB in the end (delta: 5.5 MB). Peak memory consumption was 81.0 MB. Max. memory is 8.0 GB. [2021-07-14 00:17:18,220 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.19 ms. Allocated memory is still 223.3 MB. Free memory is still 205.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 502.27 ms. Allocated memory is still 223.3 MB. Free memory was 186.9 MB in the beginning and 195.4 MB in the end (delta: -8.5 MB). Peak memory consumption was 14.2 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 54.59 ms. Allocated memory is still 223.3 MB. Free memory was 195.4 MB in the beginning and 192.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 45.54 ms. Allocated memory is still 223.3 MB. Free memory was 192.2 MB in the beginning and 190.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1622.07 ms. Allocated memory is still 223.3 MB. Free memory was 190.1 MB in the beginning and 117.1 MB in the end (delta: 73.0 MB). Peak memory consumption was 117.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4590.30 ms. Allocated memory was 223.3 MB in the beginning and 298.8 MB in the end (delta: 75.5 MB). Free memory was 116.6 MB in the beginning and 111.1 MB in the end (delta: 5.5 MB). Peak memory consumption was 81.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2582, positive: 2342, positive conditional: 2342, positive unconditional: 0, negative: 240, negative conditional: 240, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2509, positive: 2342, positive conditional: 0, positive unconditional: 2342, negative: 167, negative conditional: 0, negative unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 438, positive: 413, positive conditional: 0, positive unconditional: 413, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 438, positive: 412, positive conditional: 0, positive unconditional: 412, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 368, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 366, negative conditional: 0, negative unconditional: 366, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2509, positive: 1929, positive conditional: 0, positive unconditional: 1929, negative: 142, negative conditional: 0, negative unconditional: 142, unknown: 438, unknown conditional: 0, unknown unconditional: 438] , Statistics on independence cache: Total cache size (in pairs): 438, Positive cache size: 413, Positive conditional cache size: 0, Positive unconditional cache size: 413, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Independence queries for same thread: 73 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L711] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L712] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L714] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L716] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L718] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L719] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L720] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L721] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L722] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L723] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L724] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L725] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L726] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L727] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L728] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L729] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L730] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L731] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2017; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] FCALL, FORK 0 pthread_create(&t2017, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] 0 pthread_t t2018; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] FCALL, FORK 0 pthread_create(&t2018, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L774] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L805] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 104 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4428.7ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 41.1ms, AutomataDifference: 1817.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 535.3ms, PartialOrderReductionTime: 522.2ms, HoareTripleCheckerStatistics: 613 SDtfs, 927 SDslu, 2412 SDs, 0 SdLazy, 528 SolverSat, 97 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 541.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1498.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1251occurred in iteration=0, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 131.2ms AutomataMinimizationTime, 7 MinimizatonAttempts, 55 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 35.3ms SsaConstructionTime, 395.3ms SatisfiabilityAnalysisTime, 1245.8ms InterpolantComputationTime, 500 NumberOfCodeBlocks, 500 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 426 ConstructedInterpolants, 0 QuantifiedInterpolants, 2510 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...