./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix045_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_36eb3944-715f-40f4-b9e3-14228504533e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_36eb3944-715f-40f4-b9e3-14228504533e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_36eb3944-715f-40f4-b9e3-14228504533e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_36eb3944-715f-40f4-b9e3-14228504533e/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix045_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_36eb3944-715f-40f4-b9e3-14228504533e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_36eb3944-715f-40f4-b9e3-14228504533e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b5ac5ac0524d373e5b17171bec59d9141c5ffe2e ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 13:59:36,893 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 13:59:36,894 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 13:59:36,901 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 13:59:36,901 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 13:59:36,902 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 13:59:36,903 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 13:59:36,904 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 13:59:36,905 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 13:59:36,905 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 13:59:36,906 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 13:59:36,906 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 13:59:36,907 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 13:59:36,908 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 13:59:36,908 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 13:59:36,909 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 13:59:36,910 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 13:59:36,911 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 13:59:36,912 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 13:59:36,913 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 13:59:36,914 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 13:59:36,915 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 13:59:36,916 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 13:59:36,916 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 13:59:36,916 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 13:59:36,917 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 13:59:36,918 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 13:59:36,918 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 13:59:36,919 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 13:59:36,919 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 13:59:36,920 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 13:59:36,920 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 13:59:36,920 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 13:59:36,920 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 13:59:36,921 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 13:59:36,921 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 13:59:36,922 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_36eb3944-715f-40f4-b9e3-14228504533e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-01 13:59:36,929 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 13:59:36,929 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 13:59:36,929 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 13:59:36,929 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 13:59:36,930 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 13:59:36,930 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 13:59:36,930 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 13:59:36,930 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 13:59:36,931 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 13:59:36,931 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 13:59:36,931 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 13:59:36,931 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 13:59:36,931 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 13:59:36,931 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 13:59:36,931 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 13:59:36,932 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 13:59:36,932 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 13:59:36,932 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 13:59:36,932 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 13:59:36,932 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 13:59:36,932 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 13:59:36,933 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 13:59:36,933 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 13:59:36,933 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 13:59:36,933 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 13:59:36,933 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 13:59:36,933 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 13:59:36,933 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 13:59:36,933 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 13:59:36,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 13:59:36,934 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_36eb3944-715f-40f4-b9e3-14228504533e/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b5ac5ac0524d373e5b17171bec59d9141c5ffe2e [2018-12-01 13:59:36,957 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 13:59:36,965 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 13:59:36,968 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 13:59:36,969 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 13:59:36,969 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 13:59:36,970 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_36eb3944-715f-40f4-b9e3-14228504533e/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix045_power.opt_false-unreach-call.i [2018-12-01 13:59:37,012 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_36eb3944-715f-40f4-b9e3-14228504533e/bin-2019/uautomizer/data/5f35c0c6f/2784e31aa52b4c2097ce1902af81695d/FLAG7170097cc [2018-12-01 13:59:37,374 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 13:59:37,374 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_36eb3944-715f-40f4-b9e3-14228504533e/sv-benchmarks/c/pthread-wmm/mix045_power.opt_false-unreach-call.i [2018-12-01 13:59:37,382 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_36eb3944-715f-40f4-b9e3-14228504533e/bin-2019/uautomizer/data/5f35c0c6f/2784e31aa52b4c2097ce1902af81695d/FLAG7170097cc [2018-12-01 13:59:37,752 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_36eb3944-715f-40f4-b9e3-14228504533e/bin-2019/uautomizer/data/5f35c0c6f/2784e31aa52b4c2097ce1902af81695d [2018-12-01 13:59:37,754 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 13:59:37,755 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 13:59:37,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 13:59:37,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 13:59:37,758 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 13:59:37,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 01:59:37" (1/1) ... [2018-12-01 13:59:37,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e31f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:59:37, skipping insertion in model container [2018-12-01 13:59:37,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 01:59:37" (1/1) ... [2018-12-01 13:59:37,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 13:59:37,785 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 13:59:37,962 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 13:59:37,970 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 13:59:38,050 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 13:59:38,080 INFO L195 MainTranslator]: Completed translation [2018-12-01 13:59:38,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:59:38 WrapperNode [2018-12-01 13:59:38,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 13:59:38,081 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 13:59:38,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 13:59:38,081 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 13:59:38,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:59:38" (1/1) ... [2018-12-01 13:59:38,097 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:59:38" (1/1) ... [2018-12-01 13:59:38,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 13:59:38,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 13:59:38,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 13:59:38,116 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 13:59:38,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:59:38" (1/1) ... [2018-12-01 13:59:38,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:59:38" (1/1) ... [2018-12-01 13:59:38,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:59:38" (1/1) ... [2018-12-01 13:59:38,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:59:38" (1/1) ... [2018-12-01 13:59:38,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:59:38" (1/1) ... [2018-12-01 13:59:38,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:59:38" (1/1) ... [2018-12-01 13:59:38,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:59:38" (1/1) ... [2018-12-01 13:59:38,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 13:59:38,137 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 13:59:38,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 13:59:38,137 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 13:59:38,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:59:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36eb3944-715f-40f4-b9e3-14228504533e/bin-2019/uautomizer/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 [2018-12-01 13:59:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 13:59:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 13:59:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-01 13:59:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 13:59:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-01 13:59:38,171 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-01 13:59:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-01 13:59:38,171 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-01 13:59:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-01 13:59:38,172 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-01 13:59:38,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-01 13:59:38,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 13:59:38,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 13:59:38,173 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-01 13:59:38,508 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 13:59:38,509 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-01 13:59:38,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:59:38 BoogieIcfgContainer [2018-12-01 13:59:38,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 13:59:38,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 13:59:38,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 13:59:38,512 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 13:59:38,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 01:59:37" (1/3) ... [2018-12-01 13:59:38,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4e56e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 01:59:38, skipping insertion in model container [2018-12-01 13:59:38,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:59:38" (2/3) ... [2018-12-01 13:59:38,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4e56e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 01:59:38, skipping insertion in model container [2018-12-01 13:59:38,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:59:38" (3/3) ... [2018-12-01 13:59:38,515 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_power.opt_false-unreach-call.i [2018-12-01 13:59:38,545 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,545 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,545 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,545 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,545 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,545 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,546 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,546 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,546 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,546 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,546 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,547 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,547 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,547 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,547 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,547 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,547 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,547 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,552 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,552 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,552 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,552 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,552 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,552 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,553 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,553 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 13:59:38,562 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-01 13:59:38,562 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 13:59:38,570 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-01 13:59:38,583 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-01 13:59:38,600 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 13:59:38,600 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 13:59:38,600 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 13:59:38,600 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 13:59:38,600 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 13:59:38,600 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 13:59:38,601 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 13:59:38,601 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 13:59:38,601 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 13:59:38,608 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 157places, 194 transitions [2018-12-01 13:59:52,716 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128914 states. [2018-12-01 13:59:52,717 INFO L276 IsEmpty]: Start isEmpty. Operand 128914 states. [2018-12-01 13:59:52,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-01 13:59:52,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:59:52,724 INFO L402 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] [2018-12-01 13:59:52,725 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:59:52,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:59:52,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1531198028, now seen corresponding path program 1 times [2018-12-01 13:59:52,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:59:52,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:59:52,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:52,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:59:52,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:52,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:59:52,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:59:52,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 13:59:52,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 13:59:52,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 13:59:52,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 13:59:52,892 INFO L87 Difference]: Start difference. First operand 128914 states. Second operand 4 states. [2018-12-01 13:59:55,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:59:55,396 INFO L93 Difference]: Finished difference Result 233474 states and 1098326 transitions. [2018-12-01 13:59:55,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 13:59:55,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-01 13:59:55,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:59:56,130 INFO L225 Difference]: With dead ends: 233474 [2018-12-01 13:59:56,130 INFO L226 Difference]: Without dead ends: 203724 [2018-12-01 13:59:56,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 13:59:57,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203724 states. [2018-12-01 13:59:59,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203724 to 118894. [2018-12-01 13:59:59,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2018-12-01 13:59:59,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 559777 transitions. [2018-12-01 13:59:59,608 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 559777 transitions. Word has length 45 [2018-12-01 13:59:59,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:59:59,609 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 559777 transitions. [2018-12-01 13:59:59,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 13:59:59,609 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 559777 transitions. [2018-12-01 13:59:59,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-01 13:59:59,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:59:59,615 INFO L402 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] [2018-12-01 13:59:59,615 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 13:59:59,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:59:59,615 INFO L82 PathProgramCache]: Analyzing trace with hash -834891017, now seen corresponding path program 1 times [2018-12-01 13:59:59,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:59:59,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:59:59,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:59,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:59:59,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:59,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:59:59,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:59:59,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 13:59:59,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 13:59:59,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 13:59:59,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 13:59:59,653 INFO L87 Difference]: Start difference. First operand 118894 states and 559777 transitions. Second operand 3 states. [2018-12-01 14:00:00,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:00:00,525 INFO L93 Difference]: Finished difference Result 118894 states and 557817 transitions. [2018-12-01 14:00:00,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:00:00,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-01 14:00:00,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:00:00,844 INFO L225 Difference]: With dead ends: 118894 [2018-12-01 14:00:00,844 INFO L226 Difference]: Without dead ends: 118894 [2018-12-01 14:00:00,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:00:01,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118894 states. [2018-12-01 14:00:03,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118894 to 118894. [2018-12-01 14:00:03,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2018-12-01 14:00:03,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 557817 transitions. [2018-12-01 14:00:03,474 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 557817 transitions. Word has length 52 [2018-12-01 14:00:03,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:00:03,475 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 557817 transitions. [2018-12-01 14:00:03,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:00:03,475 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 557817 transitions. [2018-12-01 14:00:03,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-01 14:00:03,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:00:03,478 INFO L402 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] [2018-12-01 14:00:03,478 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:00:03,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:00:03,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1663124920, now seen corresponding path program 1 times [2018-12-01 14:00:03,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:00:03,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:00:03,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:03,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:03,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:03,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:00:03,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:00:03,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 14:00:03,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 14:00:03,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 14:00:03,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 14:00:03,527 INFO L87 Difference]: Start difference. First operand 118894 states and 557817 transitions. Second operand 5 states. [2018-12-01 14:00:05,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:00:05,179 INFO L93 Difference]: Finished difference Result 325274 states and 1468251 transitions. [2018-12-01 14:00:05,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 14:00:05,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-01 14:00:05,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:00:08,710 INFO L225 Difference]: With dead ends: 325274 [2018-12-01 14:00:08,711 INFO L226 Difference]: Without dead ends: 324274 [2018-12-01 14:00:08,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-01 14:00:10,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324274 states. [2018-12-01 14:00:12,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324274 to 186424. [2018-12-01 14:00:12,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186424 states. [2018-12-01 14:00:13,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186424 states to 186424 states and 840916 transitions. [2018-12-01 14:00:13,345 INFO L78 Accepts]: Start accepts. Automaton has 186424 states and 840916 transitions. Word has length 52 [2018-12-01 14:00:13,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:00:13,346 INFO L480 AbstractCegarLoop]: Abstraction has 186424 states and 840916 transitions. [2018-12-01 14:00:13,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 14:00:13,346 INFO L276 IsEmpty]: Start isEmpty. Operand 186424 states and 840916 transitions. [2018-12-01 14:00:13,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-01 14:00:13,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:00:13,351 INFO L402 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] [2018-12-01 14:00:13,352 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:00:13,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:00:13,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1719302045, now seen corresponding path program 1 times [2018-12-01 14:00:13,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:00:13,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:00:13,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:13,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:13,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:13,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:00:13,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:00:13,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 14:00:13,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 14:00:13,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 14:00:13,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 14:00:13,399 INFO L87 Difference]: Start difference. First operand 186424 states and 840916 transitions. Second operand 4 states. [2018-12-01 14:00:14,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:00:14,536 INFO L93 Difference]: Finished difference Result 163600 states and 725474 transitions. [2018-12-01 14:00:14,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 14:00:14,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-01 14:00:14,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:00:14,912 INFO L225 Difference]: With dead ends: 163600 [2018-12-01 14:00:14,912 INFO L226 Difference]: Without dead ends: 160995 [2018-12-01 14:00:14,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 14:00:15,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160995 states. [2018-12-01 14:00:20,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160995 to 160995. [2018-12-01 14:00:20,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160995 states. [2018-12-01 14:00:20,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160995 states to 160995 states and 716802 transitions. [2018-12-01 14:00:20,540 INFO L78 Accepts]: Start accepts. Automaton has 160995 states and 716802 transitions. Word has length 53 [2018-12-01 14:00:20,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:00:20,540 INFO L480 AbstractCegarLoop]: Abstraction has 160995 states and 716802 transitions. [2018-12-01 14:00:20,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 14:00:20,541 INFO L276 IsEmpty]: Start isEmpty. Operand 160995 states and 716802 transitions. [2018-12-01 14:00:20,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-01 14:00:20,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:00:20,545 INFO L402 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] [2018-12-01 14:00:20,545 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:00:20,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:00:20,546 INFO L82 PathProgramCache]: Analyzing trace with hash -137229525, now seen corresponding path program 1 times [2018-12-01 14:00:20,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:00:20,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:00:20,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:20,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:20,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:20,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:00:20,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:00:20,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:00:20,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:00:20,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:00:20,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:00:20,568 INFO L87 Difference]: Start difference. First operand 160995 states and 716802 transitions. Second operand 3 states. [2018-12-01 14:00:21,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:00:21,250 INFO L93 Difference]: Finished difference Result 160995 states and 716766 transitions. [2018-12-01 14:00:21,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:00:21,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-01 14:00:21,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:00:21,664 INFO L225 Difference]: With dead ends: 160995 [2018-12-01 14:00:21,664 INFO L226 Difference]: Without dead ends: 160995 [2018-12-01 14:00:21,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:00:22,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160995 states. [2018-12-01 14:00:24,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160995 to 160995. [2018-12-01 14:00:24,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160995 states. [2018-12-01 14:00:25,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160995 states to 160995 states and 716766 transitions. [2018-12-01 14:00:25,188 INFO L78 Accepts]: Start accepts. Automaton has 160995 states and 716766 transitions. Word has length 54 [2018-12-01 14:00:25,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:00:25,188 INFO L480 AbstractCegarLoop]: Abstraction has 160995 states and 716766 transitions. [2018-12-01 14:00:25,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:00:25,188 INFO L276 IsEmpty]: Start isEmpty. Operand 160995 states and 716766 transitions. [2018-12-01 14:00:25,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-01 14:00:25,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:00:25,192 INFO L402 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] [2018-12-01 14:00:25,193 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:00:25,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:00:25,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1605580810, now seen corresponding path program 1 times [2018-12-01 14:00:25,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:00:25,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:00:25,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:25,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:25,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:25,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:00:25,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:00:25,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 14:00:25,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 14:00:25,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 14:00:25,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 14:00:25,237 INFO L87 Difference]: Start difference. First operand 160995 states and 716766 transitions. Second operand 5 states. [2018-12-01 14:00:25,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:00:25,435 INFO L93 Difference]: Finished difference Result 51407 states and 209123 transitions. [2018-12-01 14:00:25,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 14:00:25,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-01 14:00:25,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:00:25,530 INFO L225 Difference]: With dead ends: 51407 [2018-12-01 14:00:25,530 INFO L226 Difference]: Without dead ends: 49095 [2018-12-01 14:00:25,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-01 14:00:25,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49095 states. [2018-12-01 14:00:26,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49095 to 49095. [2018-12-01 14:00:26,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49095 states. [2018-12-01 14:00:26,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49095 states to 49095 states and 200469 transitions. [2018-12-01 14:00:26,221 INFO L78 Accepts]: Start accepts. Automaton has 49095 states and 200469 transitions. Word has length 54 [2018-12-01 14:00:26,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:00:26,221 INFO L480 AbstractCegarLoop]: Abstraction has 49095 states and 200469 transitions. [2018-12-01 14:00:26,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 14:00:26,221 INFO L276 IsEmpty]: Start isEmpty. Operand 49095 states and 200469 transitions. [2018-12-01 14:00:26,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-01 14:00:26,229 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:00:26,229 INFO L402 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] [2018-12-01 14:00:26,229 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:00:26,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:00:26,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1421347436, now seen corresponding path program 1 times [2018-12-01 14:00:26,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:00:26,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:00:26,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:26,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:26,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:26,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:00:26,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:00:26,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 14:00:26,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 14:00:26,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 14:00:26,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 14:00:26,278 INFO L87 Difference]: Start difference. First operand 49095 states and 200469 transitions. Second operand 4 states. [2018-12-01 14:00:26,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:00:26,588 INFO L93 Difference]: Finished difference Result 70363 states and 282258 transitions. [2018-12-01 14:00:26,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 14:00:26,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-01 14:00:26,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:00:27,716 INFO L225 Difference]: With dead ends: 70363 [2018-12-01 14:00:27,716 INFO L226 Difference]: Without dead ends: 70363 [2018-12-01 14:00:27,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 14:00:27,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70363 states. [2018-12-01 14:00:28,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70363 to 53659. [2018-12-01 14:00:28,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53659 states. [2018-12-01 14:00:28,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53659 states to 53659 states and 217410 transitions. [2018-12-01 14:00:28,560 INFO L78 Accepts]: Start accepts. Automaton has 53659 states and 217410 transitions. Word has length 67 [2018-12-01 14:00:28,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:00:28,560 INFO L480 AbstractCegarLoop]: Abstraction has 53659 states and 217410 transitions. [2018-12-01 14:00:28,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 14:00:28,560 INFO L276 IsEmpty]: Start isEmpty. Operand 53659 states and 217410 transitions. [2018-12-01 14:00:28,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-01 14:00:28,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:00:28,571 INFO L402 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] [2018-12-01 14:00:28,571 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:00:28,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:00:28,571 INFO L82 PathProgramCache]: Analyzing trace with hash 321462899, now seen corresponding path program 1 times [2018-12-01 14:00:28,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:00:28,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:00:28,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:28,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:28,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:28,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:00:28,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:00:28,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 14:00:28,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 14:00:28,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 14:00:28,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 14:00:28,615 INFO L87 Difference]: Start difference. First operand 53659 states and 217410 transitions. Second operand 6 states. [2018-12-01 14:00:28,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:00:28,682 INFO L93 Difference]: Finished difference Result 11003 states and 37618 transitions. [2018-12-01 14:00:28,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 14:00:28,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-01 14:00:28,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:00:28,694 INFO L225 Difference]: With dead ends: 11003 [2018-12-01 14:00:28,695 INFO L226 Difference]: Without dead ends: 9291 [2018-12-01 14:00:28,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-01 14:00:28,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9291 states. [2018-12-01 14:00:28,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9291 to 8776. [2018-12-01 14:00:28,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8776 states. [2018-12-01 14:00:28,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8776 states to 8776 states and 29922 transitions. [2018-12-01 14:00:28,788 INFO L78 Accepts]: Start accepts. Automaton has 8776 states and 29922 transitions. Word has length 67 [2018-12-01 14:00:28,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:00:28,788 INFO L480 AbstractCegarLoop]: Abstraction has 8776 states and 29922 transitions. [2018-12-01 14:00:28,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 14:00:28,788 INFO L276 IsEmpty]: Start isEmpty. Operand 8776 states and 29922 transitions. [2018-12-01 14:00:28,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 14:00:28,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:00:28,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:00:28,797 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:00:28,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:00:28,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1328397457, now seen corresponding path program 1 times [2018-12-01 14:00:28,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:00:28,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:00:28,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:28,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:28,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:28,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:00:28,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:00:28,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 14:00:28,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 14:00:28,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 14:00:28,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-01 14:00:28,849 INFO L87 Difference]: Start difference. First operand 8776 states and 29922 transitions. Second operand 5 states. [2018-12-01 14:00:28,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:00:28,988 INFO L93 Difference]: Finished difference Result 10506 states and 35306 transitions. [2018-12-01 14:00:28,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 14:00:28,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-01 14:00:28,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:00:28,999 INFO L225 Difference]: With dead ends: 10506 [2018-12-01 14:00:28,999 INFO L226 Difference]: Without dead ends: 10506 [2018-12-01 14:00:28,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-01 14:00:29,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10506 states. [2018-12-01 14:00:29,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10506 to 9461. [2018-12-01 14:00:29,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9461 states. [2018-12-01 14:00:29,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9461 states to 9461 states and 32090 transitions. [2018-12-01 14:00:29,095 INFO L78 Accepts]: Start accepts. Automaton has 9461 states and 32090 transitions. Word has length 100 [2018-12-01 14:00:29,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:00:29,095 INFO L480 AbstractCegarLoop]: Abstraction has 9461 states and 32090 transitions. [2018-12-01 14:00:29,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 14:00:29,095 INFO L276 IsEmpty]: Start isEmpty. Operand 9461 states and 32090 transitions. [2018-12-01 14:00:29,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 14:00:29,105 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:00:29,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:00:29,105 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:00:29,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:00:29,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1640420216, now seen corresponding path program 1 times [2018-12-01 14:00:29,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:00:29,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:00:29,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:29,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:29,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:29,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:00:29,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:00:29,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 14:00:29,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 14:00:29,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 14:00:29,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 14:00:29,152 INFO L87 Difference]: Start difference. First operand 9461 states and 32090 transitions. Second operand 4 states. [2018-12-01 14:00:29,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:00:29,250 INFO L93 Difference]: Finished difference Result 11631 states and 38926 transitions. [2018-12-01 14:00:29,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 14:00:29,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-01 14:00:29,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:00:29,263 INFO L225 Difference]: With dead ends: 11631 [2018-12-01 14:00:29,263 INFO L226 Difference]: Without dead ends: 11631 [2018-12-01 14:00:29,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 14:00:29,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11631 states. [2018-12-01 14:00:29,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11631 to 9961. [2018-12-01 14:00:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9961 states. [2018-12-01 14:00:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9961 states to 9961 states and 33625 transitions. [2018-12-01 14:00:29,369 INFO L78 Accepts]: Start accepts. Automaton has 9961 states and 33625 transitions. Word has length 100 [2018-12-01 14:00:29,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:00:29,369 INFO L480 AbstractCegarLoop]: Abstraction has 9961 states and 33625 transitions. [2018-12-01 14:00:29,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 14:00:29,369 INFO L276 IsEmpty]: Start isEmpty. Operand 9961 states and 33625 transitions. [2018-12-01 14:00:29,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 14:00:29,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:00:29,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:00:29,380 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:00:29,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:00:29,380 INFO L82 PathProgramCache]: Analyzing trace with hash -670839193, now seen corresponding path program 1 times [2018-12-01 14:00:29,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:00:29,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:00:29,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:29,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:29,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:00:29,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:00:29,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 14:00:29,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 14:00:29,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 14:00:29,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 14:00:29,418 INFO L87 Difference]: Start difference. First operand 9961 states and 33625 transitions. Second operand 4 states. [2018-12-01 14:00:29,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:00:29,574 INFO L93 Difference]: Finished difference Result 13841 states and 46857 transitions. [2018-12-01 14:00:29,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 14:00:29,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-01 14:00:29,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:00:29,590 INFO L225 Difference]: With dead ends: 13841 [2018-12-01 14:00:29,591 INFO L226 Difference]: Without dead ends: 13841 [2018-12-01 14:00:29,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 14:00:29,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13841 states. [2018-12-01 14:00:29,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13841 to 9596. [2018-12-01 14:00:29,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9596 states. [2018-12-01 14:00:29,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9596 states to 9596 states and 32148 transitions. [2018-12-01 14:00:29,707 INFO L78 Accepts]: Start accepts. Automaton has 9596 states and 32148 transitions. Word has length 100 [2018-12-01 14:00:29,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:00:29,707 INFO L480 AbstractCegarLoop]: Abstraction has 9596 states and 32148 transitions. [2018-12-01 14:00:29,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 14:00:29,707 INFO L276 IsEmpty]: Start isEmpty. Operand 9596 states and 32148 transitions. [2018-12-01 14:00:29,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 14:00:29,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:00:29,718 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:00:29,718 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:00:29,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:00:29,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1406682119, now seen corresponding path program 2 times [2018-12-01 14:00:29,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:00:29,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:00:29,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:29,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:29,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:00:29,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:00:29,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 14:00:29,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 14:00:29,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 14:00:29,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 14:00:29,766 INFO L87 Difference]: Start difference. First operand 9596 states and 32148 transitions. Second operand 5 states. [2018-12-01 14:00:29,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:00:29,927 INFO L93 Difference]: Finished difference Result 11051 states and 36767 transitions. [2018-12-01 14:00:29,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 14:00:29,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-01 14:00:29,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:00:29,939 INFO L225 Difference]: With dead ends: 11051 [2018-12-01 14:00:29,939 INFO L226 Difference]: Without dead ends: 11051 [2018-12-01 14:00:29,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-01 14:00:29,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11051 states. [2018-12-01 14:00:30,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11051 to 9086. [2018-12-01 14:00:30,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9086 states. [2018-12-01 14:00:30,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9086 states to 9086 states and 30560 transitions. [2018-12-01 14:00:30,039 INFO L78 Accepts]: Start accepts. Automaton has 9086 states and 30560 transitions. Word has length 100 [2018-12-01 14:00:30,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:00:30,039 INFO L480 AbstractCegarLoop]: Abstraction has 9086 states and 30560 transitions. [2018-12-01 14:00:30,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 14:00:30,039 INFO L276 IsEmpty]: Start isEmpty. Operand 9086 states and 30560 transitions. [2018-12-01 14:00:30,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 14:00:30,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:00:30,047 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:00:30,047 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:00:30,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:00:30,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1115238140, now seen corresponding path program 1 times [2018-12-01 14:00:30,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:00:30,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:00:30,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:30,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 14:00:30,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:30,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:00:30,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:00:30,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 14:00:30,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 14:00:30,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 14:00:30,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-01 14:00:30,107 INFO L87 Difference]: Start difference. First operand 9086 states and 30560 transitions. Second operand 7 states. [2018-12-01 14:00:30,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:00:30,389 INFO L93 Difference]: Finished difference Result 10774 states and 35786 transitions. [2018-12-01 14:00:30,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 14:00:30,389 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-01 14:00:30,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:00:30,400 INFO L225 Difference]: With dead ends: 10774 [2018-12-01 14:00:30,400 INFO L226 Difference]: Without dead ends: 10774 [2018-12-01 14:00:30,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-01 14:00:30,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10774 states. [2018-12-01 14:00:30,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10774 to 9546. [2018-12-01 14:00:30,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9546 states. [2018-12-01 14:00:30,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9546 states to 9546 states and 31868 transitions. [2018-12-01 14:00:30,494 INFO L78 Accepts]: Start accepts. Automaton has 9546 states and 31868 transitions. Word has length 102 [2018-12-01 14:00:30,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:00:30,494 INFO L480 AbstractCegarLoop]: Abstraction has 9546 states and 31868 transitions. [2018-12-01 14:00:30,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 14:00:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 9546 states and 31868 transitions. [2018-12-01 14:00:30,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 14:00:30,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:00:30,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:00:30,503 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:00:30,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:00:30,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1996381859, now seen corresponding path program 1 times [2018-12-01 14:00:30,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:00:30,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:00:30,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:30,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:30,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:00:30,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:00:30,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 14:00:30,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 14:00:30,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 14:00:30,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 14:00:30,567 INFO L87 Difference]: Start difference. First operand 9546 states and 31868 transitions. Second operand 5 states. [2018-12-01 14:00:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:00:30,671 INFO L93 Difference]: Finished difference Result 8434 states and 27825 transitions. [2018-12-01 14:00:30,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 14:00:30,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-01 14:00:30,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:00:30,684 INFO L225 Difference]: With dead ends: 8434 [2018-12-01 14:00:30,684 INFO L226 Difference]: Without dead ends: 8434 [2018-12-01 14:00:30,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-01 14:00:30,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8434 states. [2018-12-01 14:00:30,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8434 to 8404. [2018-12-01 14:00:30,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8404 states. [2018-12-01 14:00:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8404 states to 8404 states and 27741 transitions. [2018-12-01 14:00:30,766 INFO L78 Accepts]: Start accepts. Automaton has 8404 states and 27741 transitions. Word has length 102 [2018-12-01 14:00:30,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:00:30,766 INFO L480 AbstractCegarLoop]: Abstraction has 8404 states and 27741 transitions. [2018-12-01 14:00:30,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 14:00:30,766 INFO L276 IsEmpty]: Start isEmpty. Operand 8404 states and 27741 transitions. [2018-12-01 14:00:30,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 14:00:30,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:00:30,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:00:30,773 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:00:30,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:00:30,773 INFO L82 PathProgramCache]: Analyzing trace with hash 210178468, now seen corresponding path program 1 times [2018-12-01 14:00:30,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:00:30,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:00:30,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:30,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:30,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:30,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:00:30,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:00:30,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 14:00:30,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 14:00:30,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 14:00:30,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 14:00:30,810 INFO L87 Difference]: Start difference. First operand 8404 states and 27741 transitions. Second operand 4 states. [2018-12-01 14:00:30,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:00:30,924 INFO L93 Difference]: Finished difference Result 9748 states and 32429 transitions. [2018-12-01 14:00:30,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 14:00:30,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-01 14:00:30,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:00:30,934 INFO L225 Difference]: With dead ends: 9748 [2018-12-01 14:00:30,935 INFO L226 Difference]: Without dead ends: 9748 [2018-12-01 14:00:30,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 14:00:30,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9748 states. [2018-12-01 14:00:31,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9748 to 9620. [2018-12-01 14:00:31,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9620 states. [2018-12-01 14:00:31,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9620 states to 9620 states and 32013 transitions. [2018-12-01 14:00:31,029 INFO L78 Accepts]: Start accepts. Automaton has 9620 states and 32013 transitions. Word has length 102 [2018-12-01 14:00:31,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:00:31,029 INFO L480 AbstractCegarLoop]: Abstraction has 9620 states and 32013 transitions. [2018-12-01 14:00:31,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 14:00:31,029 INFO L276 IsEmpty]: Start isEmpty. Operand 9620 states and 32013 transitions. [2018-12-01 14:00:31,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 14:00:31,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:00:31,038 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:00:31,038 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:00:31,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:00:31,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1867030875, now seen corresponding path program 1 times [2018-12-01 14:00:31,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:00:31,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:00:31,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:31,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:31,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:31,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:00:31,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:00:31,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 14:00:31,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 14:00:31,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 14:00:31,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 14:00:31,135 INFO L87 Difference]: Start difference. First operand 9620 states and 32013 transitions. Second operand 6 states. [2018-12-01 14:00:31,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:00:31,213 INFO L93 Difference]: Finished difference Result 8468 states and 27565 transitions. [2018-12-01 14:00:31,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 14:00:31,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-01 14:00:31,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:00:31,222 INFO L225 Difference]: With dead ends: 8468 [2018-12-01 14:00:31,222 INFO L226 Difference]: Without dead ends: 8468 [2018-12-01 14:00:31,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-01 14:00:31,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8468 states. [2018-12-01 14:00:31,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8468 to 7043. [2018-12-01 14:00:31,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7043 states. [2018-12-01 14:00:31,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7043 states to 7043 states and 23159 transitions. [2018-12-01 14:00:31,298 INFO L78 Accepts]: Start accepts. Automaton has 7043 states and 23159 transitions. Word has length 102 [2018-12-01 14:00:31,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:00:31,298 INFO L480 AbstractCegarLoop]: Abstraction has 7043 states and 23159 transitions. [2018-12-01 14:00:31,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 14:00:31,298 INFO L276 IsEmpty]: Start isEmpty. Operand 7043 states and 23159 transitions. [2018-12-01 14:00:31,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 14:00:31,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:00:31,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:00:31,306 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:00:31,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:00:31,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1551796347, now seen corresponding path program 1 times [2018-12-01 14:00:31,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:00:31,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:00:31,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:31,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:31,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:31,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:00:31,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:00:31,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 14:00:31,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 14:00:31,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 14:00:31,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 14:00:31,365 INFO L87 Difference]: Start difference. First operand 7043 states and 23159 transitions. Second operand 7 states. [2018-12-01 14:00:31,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:00:31,680 INFO L93 Difference]: Finished difference Result 13180 states and 42645 transitions. [2018-12-01 14:00:31,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-01 14:00:31,680 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-12-01 14:00:31,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:00:31,699 INFO L225 Difference]: With dead ends: 13180 [2018-12-01 14:00:31,700 INFO L226 Difference]: Without dead ends: 13180 [2018-12-01 14:00:31,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-01 14:00:31,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13180 states. [2018-12-01 14:00:31,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13180 to 10105. [2018-12-01 14:00:31,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10105 states. [2018-12-01 14:00:31,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10105 states to 10105 states and 33231 transitions. [2018-12-01 14:00:31,815 INFO L78 Accepts]: Start accepts. Automaton has 10105 states and 33231 transitions. Word has length 104 [2018-12-01 14:00:31,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:00:31,815 INFO L480 AbstractCegarLoop]: Abstraction has 10105 states and 33231 transitions. [2018-12-01 14:00:31,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 14:00:31,816 INFO L276 IsEmpty]: Start isEmpty. Operand 10105 states and 33231 transitions. [2018-12-01 14:00:31,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 14:00:31,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:00:31,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:00:31,825 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:00:31,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:00:31,826 INFO L82 PathProgramCache]: Analyzing trace with hash -307031866, now seen corresponding path program 1 times [2018-12-01 14:00:31,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:00:31,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:00:31,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:31,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:31,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:31,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:00:31,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:00:31,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 14:00:31,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 14:00:31,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 14:00:31,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 14:00:31,885 INFO L87 Difference]: Start difference. First operand 10105 states and 33231 transitions. Second operand 6 states. [2018-12-01 14:00:31,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:00:31,971 INFO L93 Difference]: Finished difference Result 10305 states and 33556 transitions. [2018-12-01 14:00:31,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 14:00:31,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-01 14:00:31,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:00:31,982 INFO L225 Difference]: With dead ends: 10305 [2018-12-01 14:00:31,982 INFO L226 Difference]: Without dead ends: 10305 [2018-12-01 14:00:31,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-01 14:00:31,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10305 states. [2018-12-01 14:00:32,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10305 to 10030. [2018-12-01 14:00:32,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10030 states. [2018-12-01 14:00:32,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10030 states to 10030 states and 32801 transitions. [2018-12-01 14:00:32,077 INFO L78 Accepts]: Start accepts. Automaton has 10030 states and 32801 transitions. Word has length 104 [2018-12-01 14:00:32,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:00:32,077 INFO L480 AbstractCegarLoop]: Abstraction has 10030 states and 32801 transitions. [2018-12-01 14:00:32,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 14:00:32,077 INFO L276 IsEmpty]: Start isEmpty. Operand 10030 states and 32801 transitions. [2018-12-01 14:00:32,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 14:00:32,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:00:32,085 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:00:32,086 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:00:32,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:00:32,086 INFO L82 PathProgramCache]: Analyzing trace with hash -182958619, now seen corresponding path program 1 times [2018-12-01 14:00:32,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:00:32,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:00:32,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:32,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:32,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:32,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:00:32,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:00:32,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 14:00:32,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 14:00:32,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 14:00:32,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 14:00:32,133 INFO L87 Difference]: Start difference. First operand 10030 states and 32801 transitions. Second operand 6 states. [2018-12-01 14:00:32,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:00:32,288 INFO L93 Difference]: Finished difference Result 10545 states and 34398 transitions. [2018-12-01 14:00:32,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 14:00:32,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-01 14:00:32,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:00:32,300 INFO L225 Difference]: With dead ends: 10545 [2018-12-01 14:00:32,300 INFO L226 Difference]: Without dead ends: 10545 [2018-12-01 14:00:32,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-01 14:00:32,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10545 states. [2018-12-01 14:00:32,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10545 to 10270. [2018-12-01 14:00:32,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10270 states. [2018-12-01 14:00:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10270 states to 10270 states and 33578 transitions. [2018-12-01 14:00:32,397 INFO L78 Accepts]: Start accepts. Automaton has 10270 states and 33578 transitions. Word has length 104 [2018-12-01 14:00:32,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:00:32,397 INFO L480 AbstractCegarLoop]: Abstraction has 10270 states and 33578 transitions. [2018-12-01 14:00:32,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 14:00:32,397 INFO L276 IsEmpty]: Start isEmpty. Operand 10270 states and 33578 transitions. [2018-12-01 14:00:32,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 14:00:32,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:00:32,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:00:32,406 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:00:32,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:00:32,406 INFO L82 PathProgramCache]: Analyzing trace with hash 205080899, now seen corresponding path program 1 times [2018-12-01 14:00:32,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:00:32,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:00:32,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:32,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:32,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:00:32,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:00:32,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 14:00:32,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 14:00:32,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 14:00:32,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-01 14:00:32,498 INFO L87 Difference]: Start difference. First operand 10270 states and 33578 transitions. Second operand 6 states. [2018-12-01 14:00:32,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:00:32,672 INFO L93 Difference]: Finished difference Result 14944 states and 49313 transitions. [2018-12-01 14:00:32,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 14:00:32,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-01 14:00:32,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:00:32,688 INFO L225 Difference]: With dead ends: 14944 [2018-12-01 14:00:32,688 INFO L226 Difference]: Without dead ends: 14944 [2018-12-01 14:00:32,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-01 14:00:32,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14944 states. [2018-12-01 14:00:32,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14944 to 13934. [2018-12-01 14:00:32,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13934 states. [2018-12-01 14:00:32,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13934 states to 13934 states and 46117 transitions. [2018-12-01 14:00:32,824 INFO L78 Accepts]: Start accepts. Automaton has 13934 states and 46117 transitions. Word has length 104 [2018-12-01 14:00:32,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:00:32,824 INFO L480 AbstractCegarLoop]: Abstraction has 13934 states and 46117 transitions. [2018-12-01 14:00:32,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 14:00:32,824 INFO L276 IsEmpty]: Start isEmpty. Operand 13934 states and 46117 transitions. [2018-12-01 14:00:32,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 14:00:32,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:00:32,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:00:32,836 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:00:32,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:00:32,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1449845380, now seen corresponding path program 1 times [2018-12-01 14:00:32,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:00:32,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:00:32,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:32,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:32,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:32,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:00:32,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:00:32,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 14:00:32,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 14:00:32,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 14:00:32,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 14:00:32,910 INFO L87 Difference]: Start difference. First operand 13934 states and 46117 transitions. Second operand 7 states. [2018-12-01 14:00:33,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:00:33,146 INFO L93 Difference]: Finished difference Result 26764 states and 88968 transitions. [2018-12-01 14:00:33,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 14:00:33,147 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-12-01 14:00:33,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:00:33,164 INFO L225 Difference]: With dead ends: 26764 [2018-12-01 14:00:33,164 INFO L226 Difference]: Without dead ends: 13107 [2018-12-01 14:00:33,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-01 14:00:33,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13107 states. [2018-12-01 14:00:33,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13107 to 13099. [2018-12-01 14:00:33,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13099 states. [2018-12-01 14:00:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13099 states to 13099 states and 43555 transitions. [2018-12-01 14:00:33,304 INFO L78 Accepts]: Start accepts. Automaton has 13099 states and 43555 transitions. Word has length 104 [2018-12-01 14:00:33,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:00:33,304 INFO L480 AbstractCegarLoop]: Abstraction has 13099 states and 43555 transitions. [2018-12-01 14:00:33,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 14:00:33,304 INFO L276 IsEmpty]: Start isEmpty. Operand 13099 states and 43555 transitions. [2018-12-01 14:00:33,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 14:00:33,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:00:33,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:00:33,318 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:00:33,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:00:33,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1624788262, now seen corresponding path program 1 times [2018-12-01 14:00:33,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:00:33,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:00:33,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:33,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:33,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:33,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:00:33,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:00:33,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 14:00:33,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 14:00:33,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 14:00:33,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-01 14:00:33,373 INFO L87 Difference]: Start difference. First operand 13099 states and 43555 transitions. Second operand 6 states. [2018-12-01 14:00:33,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:00:33,541 INFO L93 Difference]: Finished difference Result 13367 states and 44256 transitions. [2018-12-01 14:00:33,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 14:00:33,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-01 14:00:33,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:00:33,558 INFO L225 Difference]: With dead ends: 13367 [2018-12-01 14:00:33,558 INFO L226 Difference]: Without dead ends: 13287 [2018-12-01 14:00:33,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-01 14:00:33,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13287 states. [2018-12-01 14:00:33,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13287 to 13147. [2018-12-01 14:00:33,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13147 states. [2018-12-01 14:00:33,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13147 states to 13147 states and 43679 transitions. [2018-12-01 14:00:33,700 INFO L78 Accepts]: Start accepts. Automaton has 13147 states and 43679 transitions. Word has length 104 [2018-12-01 14:00:33,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:00:33,700 INFO L480 AbstractCegarLoop]: Abstraction has 13147 states and 43679 transitions. [2018-12-01 14:00:33,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 14:00:33,700 INFO L276 IsEmpty]: Start isEmpty. Operand 13147 states and 43679 transitions. [2018-12-01 14:00:33,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 14:00:33,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:00:33,713 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:00:33,714 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:00:33,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:00:33,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1486831737, now seen corresponding path program 2 times [2018-12-01 14:00:33,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:00:33,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:00:33,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:33,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:33,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:33,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:00:33,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:00:33,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 14:00:33,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 14:00:33,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 14:00:33,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 14:00:33,778 INFO L87 Difference]: Start difference. First operand 13147 states and 43679 transitions. Second operand 5 states. [2018-12-01 14:00:33,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:00:33,904 INFO L93 Difference]: Finished difference Result 14811 states and 49087 transitions. [2018-12-01 14:00:33,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 14:00:33,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-12-01 14:00:33,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:00:33,921 INFO L225 Difference]: With dead ends: 14811 [2018-12-01 14:00:33,921 INFO L226 Difference]: Without dead ends: 14811 [2018-12-01 14:00:33,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-01 14:00:33,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14811 states. [2018-12-01 14:00:34,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14811 to 12191. [2018-12-01 14:00:34,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12191 states. [2018-12-01 14:00:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12191 states to 12191 states and 40566 transitions. [2018-12-01 14:00:34,049 INFO L78 Accepts]: Start accepts. Automaton has 12191 states and 40566 transitions. Word has length 104 [2018-12-01 14:00:34,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:00:34,050 INFO L480 AbstractCegarLoop]: Abstraction has 12191 states and 40566 transitions. [2018-12-01 14:00:34,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 14:00:34,050 INFO L276 IsEmpty]: Start isEmpty. Operand 12191 states and 40566 transitions. [2018-12-01 14:00:34,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 14:00:34,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:00:34,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:00:34,060 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:00:34,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:00:34,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1563371078, now seen corresponding path program 2 times [2018-12-01 14:00:34,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:00:34,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:00:34,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:34,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 14:00:34,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:00:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:00:34,100 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-01 14:00:34,180 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-01 14:00:34,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 02:00:34 BasicIcfg [2018-12-01 14:00:34,181 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 14:00:34,182 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 14:00:34,182 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 14:00:34,182 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 14:00:34,182 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:59:38" (3/4) ... [2018-12-01 14:00:34,184 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-01 14:00:34,255 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_36eb3944-715f-40f4-b9e3-14228504533e/bin-2019/uautomizer/witness.graphml [2018-12-01 14:00:34,255 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 14:00:34,256 INFO L168 Benchmark]: Toolchain (without parser) took 56501.09 ms. Allocated memory was 1.0 GB in the beginning and 6.1 GB in the end (delta: 5.1 GB). Free memory was 950.6 MB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-01 14:00:34,256 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 14:00:34,257 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -101.7 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. [2018-12-01 14:00:34,257 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-12-01 14:00:34,257 INFO L168 Benchmark]: Boogie Preprocessor took 20.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 14:00:34,257 INFO L168 Benchmark]: RCFGBuilder took 371.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 997.6 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. [2018-12-01 14:00:34,257 INFO L168 Benchmark]: TraceAbstraction took 55671.76 ms. Allocated memory was 1.1 GB in the beginning and 6.1 GB in the end (delta: 5.0 GB). Free memory was 997.6 MB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-12-01 14:00:34,258 INFO L168 Benchmark]: Witness Printer took 73.26 ms. Allocated memory is still 6.1 GB. Free memory was 4.3 GB in the beginning and 4.3 GB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. [2018-12-01 14:00:34,259 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -101.7 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 371.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 997.6 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 55671.76 ms. Allocated memory was 1.1 GB in the beginning and 6.1 GB in the end (delta: 5.0 GB). Free memory was 997.6 MB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 73.26 ms. Allocated memory is still 6.1 GB. Free memory was 4.3 GB in the beginning and 4.3 GB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L676] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L678] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L690] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L691] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L692] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L693] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L694] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L695] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L696] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L697] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L698] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L699] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L700] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L702] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L703] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L704] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] -1 pthread_t t1198; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L787] FCALL, FORK -1 pthread_create(&t1198, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] -1 pthread_t t1199; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK -1 pthread_create(&t1199, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] -1 pthread_t t1200; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t1200, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 0 y$w_buff1 = y$w_buff0 [L744] 0 y$w_buff0 = 2 [L745] 0 y$w_buff1_used = y$w_buff0_used [L746] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L748] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 0 y$r_buff0_thd3 = (_Bool)1 [L755] 0 z = 1 [L758] 0 __unbuffered_p2_EAX = z [L761] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L708] 1 a = 1 [L711] 1 x = 1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 2 x = 2 [L726] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 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) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L729] 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) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L729] 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) [L730] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L730] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] 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 [L732] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L733] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 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 [L736] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -1 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 [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -1 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 [L804] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L805] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L806] -1 y$flush_delayed = weak$$choice2 [L807] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] EXPR -1 !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) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] -1 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) [L809] EXPR -1 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)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] -1 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)) [L810] EXPR -1 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)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 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)) [L811] EXPR -1 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)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -1 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)) [L812] EXPR -1 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)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] -1 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)) [L813] EXPR -1 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)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] -1 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)) [L814] EXPR -1 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)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] -1 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)) [L815] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] -1 y = y$flush_delayed ? y$mem_tmp : y [L817] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 200 locations, 3 error locations. UNSAFE Result, 55.5s OverallTime, 24 OverallIterations, 1 TraceHistogramMax, 16.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5014 SDtfs, 4273 SDslu, 10088 SDs, 0 SdLazy, 3218 SolverSat, 235 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 58 SyntacticMatches, 15 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186424occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 23.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 259038 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 2084 NumberOfCodeBlocks, 2084 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1957 ConstructedInterpolants, 0 QuantifiedInterpolants, 405333 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...