./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi008_pso.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_98c3fdcf-537c-45bc-9f0e-3abbc9b4bfb1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_98c3fdcf-537c-45bc-9f0e-3abbc9b4bfb1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_98c3fdcf-537c-45bc-9f0e-3abbc9b4bfb1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_98c3fdcf-537c-45bc-9f0e-3abbc9b4bfb1/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_98c3fdcf-537c-45bc-9f0e-3abbc9b4bfb1/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_98c3fdcf-537c-45bc-9f0e-3abbc9b4bfb1/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 c598afd7a270c7c00e096c19c67b4e2d819c5d89 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-08 23:35:43,885 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 23:35:43,887 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 23:35:43,893 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 23:35:43,893 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 23:35:43,893 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 23:35:43,894 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 23:35:43,895 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 23:35:43,896 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 23:35:43,897 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 23:35:43,898 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 23:35:43,898 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 23:35:43,899 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 23:35:43,899 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 23:35:43,900 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 23:35:43,901 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 23:35:43,901 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 23:35:43,903 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 23:35:43,904 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 23:35:43,905 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 23:35:43,906 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 23:35:43,906 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 23:35:43,908 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 23:35:43,908 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 23:35:43,908 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 23:35:43,909 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 23:35:43,909 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 23:35:43,910 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 23:35:43,911 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 23:35:43,911 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 23:35:43,911 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 23:35:43,912 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 23:35:43,912 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 23:35:43,912 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 23:35:43,913 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 23:35:43,913 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 23:35:43,914 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_98c3fdcf-537c-45bc-9f0e-3abbc9b4bfb1/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 23:35:43,923 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 23:35:43,923 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 23:35:43,924 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 23:35:43,924 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 23:35:43,925 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 23:35:43,925 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 23:35:43,925 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 23:35:43,925 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 23:35:43,925 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 23:35:43,926 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 23:35:43,926 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 23:35:43,926 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 23:35:43,926 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 23:35:43,926 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 23:35:43,926 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 23:35:43,926 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 23:35:43,927 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 23:35:43,927 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 23:35:43,927 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 23:35:43,927 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 23:35:43,927 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 23:35:43,927 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 23:35:43,927 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 23:35:43,928 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 23:35:43,928 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 23:35:43,928 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 23:35:43,928 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 23:35:43,928 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 23:35:43,928 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 23:35:43,928 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 23:35:43,928 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_98c3fdcf-537c-45bc-9f0e-3abbc9b4bfb1/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 -> c598afd7a270c7c00e096c19c67b4e2d819c5d89 [2018-12-08 23:35:43,951 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 23:35:43,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 23:35:43,960 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 23:35:43,961 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 23:35:43,961 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 23:35:43,961 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_98c3fdcf-537c-45bc-9f0e-3abbc9b4bfb1/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi008_pso.opt_false-unreach-call.i [2018-12-08 23:35:43,994 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_98c3fdcf-537c-45bc-9f0e-3abbc9b4bfb1/bin-2019/uautomizer/data/5b166cf47/6d0550af539f4e3aa9aebe0a1a784e71/FLAG39eff5bba [2018-12-08 23:35:44,375 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 23:35:44,375 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_98c3fdcf-537c-45bc-9f0e-3abbc9b4bfb1/sv-benchmarks/c/pthread-wmm/rfi008_pso.opt_false-unreach-call.i [2018-12-08 23:35:44,384 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_98c3fdcf-537c-45bc-9f0e-3abbc9b4bfb1/bin-2019/uautomizer/data/5b166cf47/6d0550af539f4e3aa9aebe0a1a784e71/FLAG39eff5bba [2018-12-08 23:35:44,744 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_98c3fdcf-537c-45bc-9f0e-3abbc9b4bfb1/bin-2019/uautomizer/data/5b166cf47/6d0550af539f4e3aa9aebe0a1a784e71 [2018-12-08 23:35:44,748 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 23:35:44,750 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 23:35:44,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 23:35:44,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 23:35:44,756 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 23:35:44,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:35:44" (1/1) ... [2018-12-08 23:35:44,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d5a83a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:35:44, skipping insertion in model container [2018-12-08 23:35:44,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:35:44" (1/1) ... [2018-12-08 23:35:44,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 23:35:44,790 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 23:35:45,000 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 23:35:45,011 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 23:35:45,090 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 23:35:45,119 INFO L195 MainTranslator]: Completed translation [2018-12-08 23:35:45,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:35:45 WrapperNode [2018-12-08 23:35:45,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 23:35:45,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 23:35:45,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 23:35:45,120 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 23:35:45,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:35:45" (1/1) ... [2018-12-08 23:35:45,136 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:35:45" (1/1) ... [2018-12-08 23:35:45,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 23:35:45,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 23:35:45,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 23:35:45,154 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 23:35:45,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:35:45" (1/1) ... [2018-12-08 23:35:45,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:35:45" (1/1) ... [2018-12-08 23:35:45,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:35:45" (1/1) ... [2018-12-08 23:35:45,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:35:45" (1/1) ... [2018-12-08 23:35:45,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:35:45" (1/1) ... [2018-12-08 23:35:45,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:35:45" (1/1) ... [2018-12-08 23:35:45,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:35:45" (1/1) ... [2018-12-08 23:35:45,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 23:35:45,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 23:35:45,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 23:35:45,174 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 23:35:45,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:35:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98c3fdcf-537c-45bc-9f0e-3abbc9b4bfb1/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-08 23:35:45,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 23:35:45,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 23:35:45,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-08 23:35:45,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 23:35:45,217 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-08 23:35:45,217 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-08 23:35:45,217 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-08 23:35:45,217 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-08 23:35:45,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-08 23:35:45,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 23:35:45,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 23:35:45,218 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-08 23:35:45,569 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 23:35:45,570 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 23:35:45,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:35:45 BoogieIcfgContainer [2018-12-08 23:35:45,570 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 23:35:45,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 23:35:45,571 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 23:35:45,572 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 23:35:45,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 11:35:44" (1/3) ... [2018-12-08 23:35:45,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b921b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 11:35:45, skipping insertion in model container [2018-12-08 23:35:45,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:35:45" (2/3) ... [2018-12-08 23:35:45,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b921b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 11:35:45, skipping insertion in model container [2018-12-08 23:35:45,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:35:45" (3/3) ... [2018-12-08 23:35:45,575 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008_pso.opt_false-unreach-call.i [2018-12-08 23:35:45,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,601 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,602 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,602 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,602 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,602 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,602 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,603 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,603 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,603 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,603 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,603 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,603 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,603 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,604 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,604 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,604 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,604 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,604 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,604 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,604 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,607 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,607 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,607 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,607 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,607 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,607 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,607 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,608 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,608 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,608 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,608 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,608 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,608 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,608 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,608 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,609 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,609 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,609 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,609 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,609 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,609 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,609 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,610 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,610 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,610 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,610 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,610 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,610 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,610 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,610 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,611 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,611 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,611 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,611 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,611 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,611 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,611 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,611 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,612 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,612 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,612 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,612 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,612 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,612 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,612 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,613 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,613 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,613 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,613 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,613 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,613 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,613 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,613 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,614 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,614 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,614 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,614 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,614 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,614 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,615 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,615 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,615 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,615 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,615 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,615 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,617 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,617 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,618 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,618 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,618 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,618 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,618 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,618 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,618 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,618 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,619 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,619 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,619 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,619 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,619 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,619 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,619 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,620 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,620 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,620 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,620 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,620 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,620 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,620 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,621 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,621 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,621 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,621 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,621 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,621 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,624 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,624 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,624 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,624 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,624 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,624 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,624 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,625 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,625 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,625 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,625 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,625 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,625 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,626 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,626 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,626 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,626 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,626 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,626 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,626 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 23:35:45,638 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 23:35:45,638 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 23:35:45,644 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 23:35:45,653 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 23:35:45,668 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 23:35:45,668 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 23:35:45,668 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 23:35:45,669 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 23:35:45,669 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 23:35:45,669 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 23:35:45,669 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 23:35:45,669 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 23:35:45,669 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 23:35:45,676 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 174places, 227 transitions [2018-12-08 23:35:51,053 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83128 states. [2018-12-08 23:35:51,054 INFO L276 IsEmpty]: Start isEmpty. Operand 83128 states. [2018-12-08 23:35:51,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 23:35:51,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:35:51,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] [2018-12-08 23:35:51,061 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:35:51,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:35:51,065 INFO L82 PathProgramCache]: Analyzing trace with hash -509770769, now seen corresponding path program 1 times [2018-12-08 23:35:51,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:35:51,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:35:51,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:35:51,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:35:51,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:35:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:35:51,218 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-08 23:35:51,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:35:51,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 23:35:51,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 23:35:51,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 23:35:51,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 23:35:51,235 INFO L87 Difference]: Start difference. First operand 83128 states. Second operand 4 states. [2018-12-08 23:35:52,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:35:52,441 INFO L93 Difference]: Finished difference Result 150584 states and 603161 transitions. [2018-12-08 23:35:52,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 23:35:52,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-12-08 23:35:52,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:35:52,817 INFO L225 Difference]: With dead ends: 150584 [2018-12-08 23:35:52,817 INFO L226 Difference]: Without dead ends: 105840 [2018-12-08 23:35:52,818 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-08 23:35:53,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105840 states. [2018-12-08 23:35:54,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105840 to 61236. [2018-12-08 23:35:54,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61236 states. [2018-12-08 23:35:54,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61236 states to 61236 states and 248291 transitions. [2018-12-08 23:35:54,940 INFO L78 Accepts]: Start accepts. Automaton has 61236 states and 248291 transitions. Word has length 39 [2018-12-08 23:35:54,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:35:54,940 INFO L480 AbstractCegarLoop]: Abstraction has 61236 states and 248291 transitions. [2018-12-08 23:35:54,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 23:35:54,941 INFO L276 IsEmpty]: Start isEmpty. Operand 61236 states and 248291 transitions. [2018-12-08 23:35:54,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 23:35:54,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:35:54,947 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] [2018-12-08 23:35:54,948 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:35:54,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:35:54,948 INFO L82 PathProgramCache]: Analyzing trace with hash 433147210, now seen corresponding path program 1 times [2018-12-08 23:35:54,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:35:54,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:35:54,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:35:54,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:35:54,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:35:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:35:55,000 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-08 23:35:55,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:35:55,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 23:35:55,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 23:35:55,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 23:35:55,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:35:55,002 INFO L87 Difference]: Start difference. First operand 61236 states and 248291 transitions. Second operand 5 states. [2018-12-08 23:35:55,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:35:55,997 INFO L93 Difference]: Finished difference Result 146040 states and 554301 transitions. [2018-12-08 23:35:55,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 23:35:55,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-08 23:35:55,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:35:56,369 INFO L225 Difference]: With dead ends: 146040 [2018-12-08 23:35:56,369 INFO L226 Difference]: Without dead ends: 145472 [2018-12-08 23:35:56,369 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-08 23:35:58,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145472 states. [2018-12-08 23:35:59,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145472 to 96614. [2018-12-08 23:35:59,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96614 states. [2018-12-08 23:36:00,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96614 states to 96614 states and 368456 transitions. [2018-12-08 23:36:00,087 INFO L78 Accepts]: Start accepts. Automaton has 96614 states and 368456 transitions. Word has length 47 [2018-12-08 23:36:00,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:00,088 INFO L480 AbstractCegarLoop]: Abstraction has 96614 states and 368456 transitions. [2018-12-08 23:36:00,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 23:36:00,088 INFO L276 IsEmpty]: Start isEmpty. Operand 96614 states and 368456 transitions. [2018-12-08 23:36:00,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 23:36:00,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:00,091 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] [2018-12-08 23:36:00,091 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:00,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:00,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1604648536, now seen corresponding path program 1 times [2018-12-08 23:36:00,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:00,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:00,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:00,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:36:00,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:00,136 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-08 23:36:00,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:00,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 23:36:00,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 23:36:00,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 23:36:00,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:36:00,137 INFO L87 Difference]: Start difference. First operand 96614 states and 368456 transitions. Second operand 5 states. [2018-12-08 23:36:01,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:01,305 INFO L93 Difference]: Finished difference Result 199270 states and 748090 transitions. [2018-12-08 23:36:01,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 23:36:01,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-08 23:36:01,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:01,761 INFO L225 Difference]: With dead ends: 199270 [2018-12-08 23:36:01,761 INFO L226 Difference]: Without dead ends: 198806 [2018-12-08 23:36:01,762 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-08 23:36:03,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198806 states. [2018-12-08 23:36:04,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198806 to 108297. [2018-12-08 23:36:04,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108297 states. [2018-12-08 23:36:04,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108297 states to 108297 states and 408660 transitions. [2018-12-08 23:36:04,900 INFO L78 Accepts]: Start accepts. Automaton has 108297 states and 408660 transitions. Word has length 48 [2018-12-08 23:36:04,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:04,900 INFO L480 AbstractCegarLoop]: Abstraction has 108297 states and 408660 transitions. [2018-12-08 23:36:04,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 23:36:04,900 INFO L276 IsEmpty]: Start isEmpty. Operand 108297 states and 408660 transitions. [2018-12-08 23:36:04,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 23:36:04,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:04,906 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] [2018-12-08 23:36:04,906 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:04,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:04,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1056563390, now seen corresponding path program 1 times [2018-12-08 23:36:04,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:04,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:04,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:04,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:36:04,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:04,932 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-08 23:36:04,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:04,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:36:04,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:36:04,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:36:04,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:36:04,933 INFO L87 Difference]: Start difference. First operand 108297 states and 408660 transitions. Second operand 3 states. [2018-12-08 23:36:06,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:06,808 INFO L93 Difference]: Finished difference Result 179116 states and 655175 transitions. [2018-12-08 23:36:06,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:36:06,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-08 23:36:06,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:07,162 INFO L225 Difference]: With dead ends: 179116 [2018-12-08 23:36:07,163 INFO L226 Difference]: Without dead ends: 179116 [2018-12-08 23:36:07,163 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-08 23:36:08,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179116 states. [2018-12-08 23:36:10,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179116 to 163647. [2018-12-08 23:36:10,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163647 states. [2018-12-08 23:36:10,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163647 states to 163647 states and 603626 transitions. [2018-12-08 23:36:10,578 INFO L78 Accepts]: Start accepts. Automaton has 163647 states and 603626 transitions. Word has length 50 [2018-12-08 23:36:10,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:10,578 INFO L480 AbstractCegarLoop]: Abstraction has 163647 states and 603626 transitions. [2018-12-08 23:36:10,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:36:10,578 INFO L276 IsEmpty]: Start isEmpty. Operand 163647 states and 603626 transitions. [2018-12-08 23:36:10,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 23:36:10,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:10,592 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-08 23:36:10,592 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:10,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:10,593 INFO L82 PathProgramCache]: Analyzing trace with hash 294072713, now seen corresponding path program 1 times [2018-12-08 23:36:10,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:10,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:10,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:10,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:36:10,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:10,652 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-08 23:36:10,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:10,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 23:36:10,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 23:36:10,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 23:36:10,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 23:36:10,653 INFO L87 Difference]: Start difference. First operand 163647 states and 603626 transitions. Second operand 6 states. [2018-12-08 23:36:12,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:12,264 INFO L93 Difference]: Finished difference Result 315524 states and 1139599 transitions. [2018-12-08 23:36:12,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 23:36:12,265 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-08 23:36:12,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:12,966 INFO L225 Difference]: With dead ends: 315524 [2018-12-08 23:36:12,966 INFO L226 Difference]: Without dead ends: 314988 [2018-12-08 23:36:12,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-08 23:36:15,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314988 states. [2018-12-08 23:36:17,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314988 to 164410. [2018-12-08 23:36:17,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164410 states. [2018-12-08 23:36:20,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164410 states to 164410 states and 606497 transitions. [2018-12-08 23:36:20,619 INFO L78 Accepts]: Start accepts. Automaton has 164410 states and 606497 transitions. Word has length 54 [2018-12-08 23:36:20,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:20,619 INFO L480 AbstractCegarLoop]: Abstraction has 164410 states and 606497 transitions. [2018-12-08 23:36:20,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 23:36:20,619 INFO L276 IsEmpty]: Start isEmpty. Operand 164410 states and 606497 transitions. [2018-12-08 23:36:20,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 23:36:20,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:20,633 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-08 23:36:20,634 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:20,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:20,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1217557252, now seen corresponding path program 1 times [2018-12-08 23:36:20,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:20,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:20,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:20,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:36:20,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:20,703 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-08 23:36:20,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:20,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 23:36:20,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 23:36:20,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 23:36:20,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 23:36:20,704 INFO L87 Difference]: Start difference. First operand 164410 states and 606497 transitions. Second operand 6 states. [2018-12-08 23:36:21,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:21,978 INFO L93 Difference]: Finished difference Result 215867 states and 792771 transitions. [2018-12-08 23:36:21,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 23:36:21,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-08 23:36:21,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:22,471 INFO L225 Difference]: With dead ends: 215867 [2018-12-08 23:36:22,471 INFO L226 Difference]: Without dead ends: 215867 [2018-12-08 23:36:22,471 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-08 23:36:24,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215867 states. [2018-12-08 23:36:26,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215867 to 201216. [2018-12-08 23:36:26,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201216 states. [2018-12-08 23:36:26,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201216 states to 201216 states and 739038 transitions. [2018-12-08 23:36:26,863 INFO L78 Accepts]: Start accepts. Automaton has 201216 states and 739038 transitions. Word has length 54 [2018-12-08 23:36:26,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:26,863 INFO L480 AbstractCegarLoop]: Abstraction has 201216 states and 739038 transitions. [2018-12-08 23:36:26,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 23:36:26,863 INFO L276 IsEmpty]: Start isEmpty. Operand 201216 states and 739038 transitions. [2018-12-08 23:36:26,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 23:36:26,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:26,882 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-08 23:36:26,882 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:26,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:26,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1280458685, now seen corresponding path program 1 times [2018-12-08 23:36:26,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:26,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:26,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:26,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:36:26,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:26,915 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-08 23:36:26,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:26,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 23:36:26,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 23:36:26,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 23:36:26,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 23:36:26,916 INFO L87 Difference]: Start difference. First operand 201216 states and 739038 transitions. Second operand 4 states. [2018-12-08 23:36:27,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:27,023 INFO L93 Difference]: Finished difference Result 38680 states and 122685 transitions. [2018-12-08 23:36:27,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 23:36:27,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-08 23:36:27,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:27,067 INFO L225 Difference]: With dead ends: 38680 [2018-12-08 23:36:27,067 INFO L226 Difference]: Without dead ends: 32084 [2018-12-08 23:36:27,067 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-08 23:36:27,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32084 states. [2018-12-08 23:36:27,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32084 to 31837. [2018-12-08 23:36:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31837 states. [2018-12-08 23:36:27,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31837 states to 31837 states and 99516 transitions. [2018-12-08 23:36:27,693 INFO L78 Accepts]: Start accepts. Automaton has 31837 states and 99516 transitions. Word has length 54 [2018-12-08 23:36:27,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:27,694 INFO L480 AbstractCegarLoop]: Abstraction has 31837 states and 99516 transitions. [2018-12-08 23:36:27,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 23:36:27,694 INFO L276 IsEmpty]: Start isEmpty. Operand 31837 states and 99516 transitions. [2018-12-08 23:36:27,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 23:36:27,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:27,698 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] [2018-12-08 23:36:27,698 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:27,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:27,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1118166751, now seen corresponding path program 1 times [2018-12-08 23:36:27,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:27,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:27,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:27,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:36:27,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:27,727 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-08 23:36:27,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:27,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 23:36:27,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 23:36:27,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 23:36:27,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 23:36:27,728 INFO L87 Difference]: Start difference. First operand 31837 states and 99516 transitions. Second operand 4 states. [2018-12-08 23:36:27,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:27,948 INFO L93 Difference]: Finished difference Result 41209 states and 129950 transitions. [2018-12-08 23:36:27,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 23:36:27,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-08 23:36:27,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:28,001 INFO L225 Difference]: With dead ends: 41209 [2018-12-08 23:36:28,001 INFO L226 Difference]: Without dead ends: 41209 [2018-12-08 23:36:28,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-08 23:36:28,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41209 states. [2018-12-08 23:36:28,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41209 to 35933. [2018-12-08 23:36:28,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35933 states. [2018-12-08 23:36:28,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35933 states to 35933 states and 112645 transitions. [2018-12-08 23:36:28,429 INFO L78 Accepts]: Start accepts. Automaton has 35933 states and 112645 transitions. Word has length 64 [2018-12-08 23:36:28,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:28,430 INFO L480 AbstractCegarLoop]: Abstraction has 35933 states and 112645 transitions. [2018-12-08 23:36:28,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 23:36:28,430 INFO L276 IsEmpty]: Start isEmpty. Operand 35933 states and 112645 transitions. [2018-12-08 23:36:28,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 23:36:28,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:28,435 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] [2018-12-08 23:36:28,435 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:28,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:28,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1433990210, now seen corresponding path program 1 times [2018-12-08 23:36:28,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:28,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:28,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:28,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:36:28,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:28,480 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-08 23:36:28,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:28,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 23:36:28,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 23:36:28,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 23:36:28,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 23:36:28,480 INFO L87 Difference]: Start difference. First operand 35933 states and 112645 transitions. Second operand 6 states. [2018-12-08 23:36:29,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:29,060 INFO L93 Difference]: Finished difference Result 72510 states and 225561 transitions. [2018-12-08 23:36:29,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 23:36:29,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-08 23:36:29,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:29,162 INFO L225 Difference]: With dead ends: 72510 [2018-12-08 23:36:29,162 INFO L226 Difference]: Without dead ends: 72446 [2018-12-08 23:36:29,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-08 23:36:29,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72446 states. [2018-12-08 23:36:29,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72446 to 40893. [2018-12-08 23:36:29,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40893 states. [2018-12-08 23:36:29,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40893 states to 40893 states and 126623 transitions. [2018-12-08 23:36:29,791 INFO L78 Accepts]: Start accepts. Automaton has 40893 states and 126623 transitions. Word has length 64 [2018-12-08 23:36:29,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:29,792 INFO L480 AbstractCegarLoop]: Abstraction has 40893 states and 126623 transitions. [2018-12-08 23:36:29,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 23:36:29,792 INFO L276 IsEmpty]: Start isEmpty. Operand 40893 states and 126623 transitions. [2018-12-08 23:36:29,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 23:36:29,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:29,802 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] [2018-12-08 23:36:29,802 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:29,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:29,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1608074001, now seen corresponding path program 1 times [2018-12-08 23:36:29,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:29,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:29,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:29,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:36:29,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:29,827 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-08 23:36:29,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:29,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:36:29,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:36:29,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:36:29,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:36:29,828 INFO L87 Difference]: Start difference. First operand 40893 states and 126623 transitions. Second operand 3 states. [2018-12-08 23:36:29,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:29,963 INFO L93 Difference]: Finished difference Result 46898 states and 143100 transitions. [2018-12-08 23:36:29,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:36:29,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-12-08 23:36:29,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:30,020 INFO L225 Difference]: With dead ends: 46898 [2018-12-08 23:36:30,020 INFO L226 Difference]: Without dead ends: 46898 [2018-12-08 23:36:30,020 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-08 23:36:30,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46898 states. [2018-12-08 23:36:30,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46898 to 40581. [2018-12-08 23:36:30,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40581 states. [2018-12-08 23:36:30,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40581 states to 40581 states and 123025 transitions. [2018-12-08 23:36:30,585 INFO L78 Accepts]: Start accepts. Automaton has 40581 states and 123025 transitions. Word has length 70 [2018-12-08 23:36:30,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:30,586 INFO L480 AbstractCegarLoop]: Abstraction has 40581 states and 123025 transitions. [2018-12-08 23:36:30,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:36:30,586 INFO L276 IsEmpty]: Start isEmpty. Operand 40581 states and 123025 transitions. [2018-12-08 23:36:30,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 23:36:30,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:30,596 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] [2018-12-08 23:36:30,596 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:30,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:30,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1198327353, now seen corresponding path program 1 times [2018-12-08 23:36:30,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:30,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:30,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:30,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:36:30,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:30,660 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-08 23:36:30,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:30,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 23:36:30,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 23:36:30,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 23:36:30,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 23:36:30,661 INFO L87 Difference]: Start difference. First operand 40581 states and 123025 transitions. Second operand 7 states. [2018-12-08 23:36:31,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:31,377 INFO L93 Difference]: Finished difference Result 48737 states and 147767 transitions. [2018-12-08 23:36:31,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 23:36:31,377 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-12-08 23:36:31,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:31,435 INFO L225 Difference]: With dead ends: 48737 [2018-12-08 23:36:31,436 INFO L226 Difference]: Without dead ends: 48737 [2018-12-08 23:36:31,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-08 23:36:31,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48737 states. [2018-12-08 23:36:31,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48737 to 45065. [2018-12-08 23:36:31,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45065 states. [2018-12-08 23:36:31,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45065 states to 45065 states and 136967 transitions. [2018-12-08 23:36:31,951 INFO L78 Accepts]: Start accepts. Automaton has 45065 states and 136967 transitions. Word has length 71 [2018-12-08 23:36:31,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:31,951 INFO L480 AbstractCegarLoop]: Abstraction has 45065 states and 136967 transitions. [2018-12-08 23:36:31,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 23:36:31,951 INFO L276 IsEmpty]: Start isEmpty. Operand 45065 states and 136967 transitions. [2018-12-08 23:36:31,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 23:36:31,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:31,963 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] [2018-12-08 23:36:31,963 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:31,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:31,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1299688584, now seen corresponding path program 1 times [2018-12-08 23:36:31,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:31,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:31,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:31,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:36:31,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:31,994 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-08 23:36:31,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:31,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 23:36:31,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 23:36:31,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 23:36:31,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:36:31,994 INFO L87 Difference]: Start difference. First operand 45065 states and 136967 transitions. Second operand 5 states. [2018-12-08 23:36:32,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:32,037 INFO L93 Difference]: Finished difference Result 13109 states and 33092 transitions. [2018-12-08 23:36:32,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 23:36:32,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-12-08 23:36:32,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:32,046 INFO L225 Difference]: With dead ends: 13109 [2018-12-08 23:36:32,046 INFO L226 Difference]: Without dead ends: 10985 [2018-12-08 23:36:32,046 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-08 23:36:32,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10985 states. [2018-12-08 23:36:32,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10985 to 8180. [2018-12-08 23:36:32,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8180 states. [2018-12-08 23:36:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8180 states to 8180 states and 20398 transitions. [2018-12-08 23:36:32,124 INFO L78 Accepts]: Start accepts. Automaton has 8180 states and 20398 transitions. Word has length 71 [2018-12-08 23:36:32,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:32,124 INFO L480 AbstractCegarLoop]: Abstraction has 8180 states and 20398 transitions. [2018-12-08 23:36:32,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 23:36:32,124 INFO L276 IsEmpty]: Start isEmpty. Operand 8180 states and 20398 transitions. [2018-12-08 23:36:32,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 23:36:32,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:32,130 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] [2018-12-08 23:36:32,130 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:32,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:32,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1365879286, now seen corresponding path program 1 times [2018-12-08 23:36:32,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:32,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:32,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:32,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:36:32,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:32,180 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-08 23:36:32,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:32,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 23:36:32,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 23:36:32,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 23:36:32,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 23:36:32,181 INFO L87 Difference]: Start difference. First operand 8180 states and 20398 transitions. Second operand 4 states. [2018-12-08 23:36:32,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:32,301 INFO L93 Difference]: Finished difference Result 9531 states and 23362 transitions. [2018-12-08 23:36:32,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 23:36:32,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-12-08 23:36:32,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:32,308 INFO L225 Difference]: With dead ends: 9531 [2018-12-08 23:36:32,309 INFO L226 Difference]: Without dead ends: 9531 [2018-12-08 23:36:32,309 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-08 23:36:32,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9531 states. [2018-12-08 23:36:32,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9531 to 9028. [2018-12-08 23:36:32,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9028 states. [2018-12-08 23:36:32,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9028 states to 9028 states and 22245 transitions. [2018-12-08 23:36:32,382 INFO L78 Accepts]: Start accepts. Automaton has 9028 states and 22245 transitions. Word has length 99 [2018-12-08 23:36:32,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:32,383 INFO L480 AbstractCegarLoop]: Abstraction has 9028 states and 22245 transitions. [2018-12-08 23:36:32,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 23:36:32,383 INFO L276 IsEmpty]: Start isEmpty. Operand 9028 states and 22245 transitions. [2018-12-08 23:36:32,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 23:36:32,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:32,389 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] [2018-12-08 23:36:32,389 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:32,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:32,389 INFO L82 PathProgramCache]: Analyzing trace with hash 851878667, now seen corresponding path program 1 times [2018-12-08 23:36:32,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:32,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:32,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:32,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:36:32,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:32,416 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-08 23:36:32,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:32,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:36:32,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:36:32,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:36:32,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:36:32,417 INFO L87 Difference]: Start difference. First operand 9028 states and 22245 transitions. Second operand 3 states. [2018-12-08 23:36:32,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:32,562 INFO L93 Difference]: Finished difference Result 12279 states and 29754 transitions. [2018-12-08 23:36:32,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:36:32,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-12-08 23:36:32,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:32,572 INFO L225 Difference]: With dead ends: 12279 [2018-12-08 23:36:32,572 INFO L226 Difference]: Without dead ends: 12279 [2018-12-08 23:36:32,573 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-08 23:36:32,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12279 states. [2018-12-08 23:36:32,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12279 to 11108. [2018-12-08 23:36:32,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11108 states. [2018-12-08 23:36:32,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11108 states to 11108 states and 27145 transitions. [2018-12-08 23:36:32,663 INFO L78 Accepts]: Start accepts. Automaton has 11108 states and 27145 transitions. Word has length 99 [2018-12-08 23:36:32,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:32,663 INFO L480 AbstractCegarLoop]: Abstraction has 11108 states and 27145 transitions. [2018-12-08 23:36:32,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:36:32,663 INFO L276 IsEmpty]: Start isEmpty. Operand 11108 states and 27145 transitions. [2018-12-08 23:36:32,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 23:36:32,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:32,671 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] [2018-12-08 23:36:32,671 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:32,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:32,672 INFO L82 PathProgramCache]: Analyzing trace with hash -884505717, now seen corresponding path program 2 times [2018-12-08 23:36:32,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:32,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:32,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:32,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:36:32,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:32,728 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-08 23:36:32,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:32,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 23:36:32,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 23:36:32,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 23:36:32,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:36:32,729 INFO L87 Difference]: Start difference. First operand 11108 states and 27145 transitions. Second operand 5 states. [2018-12-08 23:36:32,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:32,936 INFO L93 Difference]: Finished difference Result 13175 states and 31571 transitions. [2018-12-08 23:36:32,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 23:36:32,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-08 23:36:32,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:32,946 INFO L225 Difference]: With dead ends: 13175 [2018-12-08 23:36:32,947 INFO L226 Difference]: Without dead ends: 13175 [2018-12-08 23:36:32,947 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-08 23:36:32,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13175 states. [2018-12-08 23:36:33,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13175 to 11735. [2018-12-08 23:36:33,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11735 states. [2018-12-08 23:36:33,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11735 states to 11735 states and 28445 transitions. [2018-12-08 23:36:33,054 INFO L78 Accepts]: Start accepts. Automaton has 11735 states and 28445 transitions. Word has length 99 [2018-12-08 23:36:33,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:33,054 INFO L480 AbstractCegarLoop]: Abstraction has 11735 states and 28445 transitions. [2018-12-08 23:36:33,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 23:36:33,054 INFO L276 IsEmpty]: Start isEmpty. Operand 11735 states and 28445 transitions. [2018-12-08 23:36:33,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 23:36:33,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:33,064 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] [2018-12-08 23:36:33,064 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:33,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:33,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1780279825, now seen corresponding path program 3 times [2018-12-08 23:36:33,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:33,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:33,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:33,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 23:36:33,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:33,123 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-08 23:36:33,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:33,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 23:36:33,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 23:36:33,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 23:36:33,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 23:36:33,124 INFO L87 Difference]: Start difference. First operand 11735 states and 28445 transitions. Second operand 6 states. [2018-12-08 23:36:33,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:33,455 INFO L93 Difference]: Finished difference Result 14380 states and 34262 transitions. [2018-12-08 23:36:33,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 23:36:33,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-08 23:36:33,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:33,467 INFO L225 Difference]: With dead ends: 14380 [2018-12-08 23:36:33,467 INFO L226 Difference]: Without dead ends: 14380 [2018-12-08 23:36:33,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-08 23:36:33,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14380 states. [2018-12-08 23:36:33,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14380 to 11533. [2018-12-08 23:36:33,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11533 states. [2018-12-08 23:36:33,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11533 states to 11533 states and 27501 transitions. [2018-12-08 23:36:33,572 INFO L78 Accepts]: Start accepts. Automaton has 11533 states and 27501 transitions. Word has length 99 [2018-12-08 23:36:33,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:33,573 INFO L480 AbstractCegarLoop]: Abstraction has 11533 states and 27501 transitions. [2018-12-08 23:36:33,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 23:36:33,573 INFO L276 IsEmpty]: Start isEmpty. Operand 11533 states and 27501 transitions. [2018-12-08 23:36:33,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 23:36:33,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:33,580 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] [2018-12-08 23:36:33,580 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:33,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:33,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1014106637, now seen corresponding path program 1 times [2018-12-08 23:36:33,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:33,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:33,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:33,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 23:36:33,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:33,622 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-08 23:36:33,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:33,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 23:36:33,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 23:36:33,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 23:36:33,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:36:33,623 INFO L87 Difference]: Start difference. First operand 11533 states and 27501 transitions. Second operand 5 states. [2018-12-08 23:36:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:33,801 INFO L93 Difference]: Finished difference Result 12356 states and 29202 transitions. [2018-12-08 23:36:33,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 23:36:33,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-08 23:36:33,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:33,812 INFO L225 Difference]: With dead ends: 12356 [2018-12-08 23:36:33,812 INFO L226 Difference]: Without dead ends: 12356 [2018-12-08 23:36:33,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-08 23:36:33,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12356 states. [2018-12-08 23:36:33,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12356 to 11700. [2018-12-08 23:36:33,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11700 states. [2018-12-08 23:36:33,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11700 states to 11700 states and 27858 transitions. [2018-12-08 23:36:33,907 INFO L78 Accepts]: Start accepts. Automaton has 11700 states and 27858 transitions. Word has length 101 [2018-12-08 23:36:33,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:33,907 INFO L480 AbstractCegarLoop]: Abstraction has 11700 states and 27858 transitions. [2018-12-08 23:36:33,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 23:36:33,907 INFO L276 IsEmpty]: Start isEmpty. Operand 11700 states and 27858 transitions. [2018-12-08 23:36:33,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 23:36:33,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:33,915 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] [2018-12-08 23:36:33,915 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:33,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:33,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1474010974, now seen corresponding path program 1 times [2018-12-08 23:36:33,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:33,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:33,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:33,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:36:33,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:33,959 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-08 23:36:33,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:33,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 23:36:33,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 23:36:33,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 23:36:33,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:36:33,960 INFO L87 Difference]: Start difference. First operand 11700 states and 27858 transitions. Second operand 5 states. [2018-12-08 23:36:34,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:34,076 INFO L93 Difference]: Finished difference Result 13328 states and 31867 transitions. [2018-12-08 23:36:34,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 23:36:34,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-08 23:36:34,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:34,089 INFO L225 Difference]: With dead ends: 13328 [2018-12-08 23:36:34,089 INFO L226 Difference]: Without dead ends: 13328 [2018-12-08 23:36:34,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 23:36:34,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13328 states. [2018-12-08 23:36:34,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13328 to 11920. [2018-12-08 23:36:34,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11920 states. [2018-12-08 23:36:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11920 states to 11920 states and 28399 transitions. [2018-12-08 23:36:34,185 INFO L78 Accepts]: Start accepts. Automaton has 11920 states and 28399 transitions. Word has length 101 [2018-12-08 23:36:34,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:34,185 INFO L480 AbstractCegarLoop]: Abstraction has 11920 states and 28399 transitions. [2018-12-08 23:36:34,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 23:36:34,185 INFO L276 IsEmpty]: Start isEmpty. Operand 11920 states and 28399 transitions. [2018-12-08 23:36:34,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 23:36:34,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:34,193 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] [2018-12-08 23:36:34,193 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:34,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:34,193 INFO L82 PathProgramCache]: Analyzing trace with hash 251469923, now seen corresponding path program 1 times [2018-12-08 23:36:34,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:34,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:34,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:34,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:36:34,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:34,240 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-08 23:36:34,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:34,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 23:36:34,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 23:36:34,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 23:36:34,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 23:36:34,241 INFO L87 Difference]: Start difference. First operand 11920 states and 28399 transitions. Second operand 6 states. [2018-12-08 23:36:34,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:34,464 INFO L93 Difference]: Finished difference Result 13240 states and 31263 transitions. [2018-12-08 23:36:34,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 23:36:34,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2018-12-08 23:36:34,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:34,473 INFO L225 Difference]: With dead ends: 13240 [2018-12-08 23:36:34,473 INFO L226 Difference]: Without dead ends: 13240 [2018-12-08 23:36:34,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-08 23:36:34,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13240 states. [2018-12-08 23:36:34,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13240 to 11920. [2018-12-08 23:36:34,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11920 states. [2018-12-08 23:36:34,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11920 states to 11920 states and 28399 transitions. [2018-12-08 23:36:34,570 INFO L78 Accepts]: Start accepts. Automaton has 11920 states and 28399 transitions. Word has length 101 [2018-12-08 23:36:34,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:34,570 INFO L480 AbstractCegarLoop]: Abstraction has 11920 states and 28399 transitions. [2018-12-08 23:36:34,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 23:36:34,570 INFO L276 IsEmpty]: Start isEmpty. Operand 11920 states and 28399 transitions. [2018-12-08 23:36:34,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 23:36:34,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:34,578 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] [2018-12-08 23:36:34,579 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:34,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:34,579 INFO L82 PathProgramCache]: Analyzing trace with hash -912894357, now seen corresponding path program 1 times [2018-12-08 23:36:34,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:34,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:34,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:34,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:36:34,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:34,642 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-08 23:36:34,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:34,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 23:36:34,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 23:36:34,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 23:36:34,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 23:36:34,643 INFO L87 Difference]: Start difference. First operand 11920 states and 28399 transitions. Second operand 6 states. [2018-12-08 23:36:34,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:34,881 INFO L93 Difference]: Finished difference Result 14375 states and 34078 transitions. [2018-12-08 23:36:34,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 23:36:34,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2018-12-08 23:36:34,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:34,891 INFO L225 Difference]: With dead ends: 14375 [2018-12-08 23:36:34,891 INFO L226 Difference]: Without dead ends: 14343 [2018-12-08 23:36:34,891 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-08 23:36:34,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14343 states. [2018-12-08 23:36:34,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14343 to 13137. [2018-12-08 23:36:34,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13137 states. [2018-12-08 23:36:35,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13137 states to 13137 states and 31250 transitions. [2018-12-08 23:36:35,004 INFO L78 Accepts]: Start accepts. Automaton has 13137 states and 31250 transitions. Word has length 101 [2018-12-08 23:36:35,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:35,004 INFO L480 AbstractCegarLoop]: Abstraction has 13137 states and 31250 transitions. [2018-12-08 23:36:35,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 23:36:35,005 INFO L276 IsEmpty]: Start isEmpty. Operand 13137 states and 31250 transitions. [2018-12-08 23:36:35,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 23:36:35,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:35,014 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] [2018-12-08 23:36:35,015 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:35,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:35,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1585121580, now seen corresponding path program 1 times [2018-12-08 23:36:35,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:35,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:35,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:35,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:36:35,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:35,085 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-08 23:36:35,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:35,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 23:36:35,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 23:36:35,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 23:36:35,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 23:36:35,086 INFO L87 Difference]: Start difference. First operand 13137 states and 31250 transitions. Second operand 7 states. [2018-12-08 23:36:35,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:35,213 INFO L93 Difference]: Finished difference Result 16676 states and 39852 transitions. [2018-12-08 23:36:35,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 23:36:35,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-12-08 23:36:35,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:35,227 INFO L225 Difference]: With dead ends: 16676 [2018-12-08 23:36:35,227 INFO L226 Difference]: Without dead ends: 16676 [2018-12-08 23:36:35,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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-08 23:36:35,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16676 states. [2018-12-08 23:36:35,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16676 to 14237. [2018-12-08 23:36:35,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14237 states. [2018-12-08 23:36:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14237 states to 14237 states and 33950 transitions. [2018-12-08 23:36:35,357 INFO L78 Accepts]: Start accepts. Automaton has 14237 states and 33950 transitions. Word has length 101 [2018-12-08 23:36:35,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:35,357 INFO L480 AbstractCegarLoop]: Abstraction has 14237 states and 33950 transitions. [2018-12-08 23:36:35,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 23:36:35,357 INFO L276 IsEmpty]: Start isEmpty. Operand 14237 states and 33950 transitions. [2018-12-08 23:36:35,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 23:36:35,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:35,367 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] [2018-12-08 23:36:35,367 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:35,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:35,368 INFO L82 PathProgramCache]: Analyzing trace with hash 740649709, now seen corresponding path program 1 times [2018-12-08 23:36:35,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:35,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:35,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:35,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:36:35,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:35,387 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-08 23:36:35,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:35,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:36:35,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:36:35,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:36:35,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:36:35,388 INFO L87 Difference]: Start difference. First operand 14237 states and 33950 transitions. Second operand 3 states. [2018-12-08 23:36:35,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:35,423 INFO L93 Difference]: Finished difference Result 17431 states and 41362 transitions. [2018-12-08 23:36:35,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:36:35,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-12-08 23:36:35,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:35,436 INFO L225 Difference]: With dead ends: 17431 [2018-12-08 23:36:35,436 INFO L226 Difference]: Without dead ends: 17431 [2018-12-08 23:36:35,436 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-08 23:36:35,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17431 states. [2018-12-08 23:36:35,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17431 to 17353. [2018-12-08 23:36:35,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17353 states. [2018-12-08 23:36:35,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17353 states to 17353 states and 41198 transitions. [2018-12-08 23:36:35,573 INFO L78 Accepts]: Start accepts. Automaton has 17353 states and 41198 transitions. Word has length 101 [2018-12-08 23:36:35,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:35,573 INFO L480 AbstractCegarLoop]: Abstraction has 17353 states and 41198 transitions. [2018-12-08 23:36:35,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:36:35,573 INFO L276 IsEmpty]: Start isEmpty. Operand 17353 states and 41198 transitions. [2018-12-08 23:36:35,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 23:36:35,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:35,586 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] [2018-12-08 23:36:35,586 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:35,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:35,586 INFO L82 PathProgramCache]: Analyzing trace with hash 673642956, now seen corresponding path program 1 times [2018-12-08 23:36:35,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:35,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:35,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:35,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:36:35,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:35,617 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-08 23:36:35,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:35,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:36:35,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:36:35,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:36:35,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:36:35,618 INFO L87 Difference]: Start difference. First operand 17353 states and 41198 transitions. Second operand 3 states. [2018-12-08 23:36:35,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:35,655 INFO L93 Difference]: Finished difference Result 17289 states and 40926 transitions. [2018-12-08 23:36:35,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:36:35,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-12-08 23:36:35,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:35,668 INFO L225 Difference]: With dead ends: 17289 [2018-12-08 23:36:35,668 INFO L226 Difference]: Without dead ends: 17257 [2018-12-08 23:36:35,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:36:35,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17257 states. [2018-12-08 23:36:35,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17257 to 15706. [2018-12-08 23:36:35,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15706 states. [2018-12-08 23:36:35,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15706 states to 15706 states and 37353 transitions. [2018-12-08 23:36:35,807 INFO L78 Accepts]: Start accepts. Automaton has 15706 states and 37353 transitions. Word has length 101 [2018-12-08 23:36:35,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:35,807 INFO L480 AbstractCegarLoop]: Abstraction has 15706 states and 37353 transitions. [2018-12-08 23:36:35,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:36:35,807 INFO L276 IsEmpty]: Start isEmpty. Operand 15706 states and 37353 transitions. [2018-12-08 23:36:35,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 23:36:35,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:35,818 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] [2018-12-08 23:36:35,818 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:35,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:35,818 INFO L82 PathProgramCache]: Analyzing trace with hash 983223963, now seen corresponding path program 1 times [2018-12-08 23:36:35,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:35,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:35,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:35,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:36:35,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:35,876 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-08 23:36:35,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:35,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 23:36:35,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 23:36:35,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 23:36:35,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-08 23:36:35,877 INFO L87 Difference]: Start difference. First operand 15706 states and 37353 transitions. Second operand 8 states. [2018-12-08 23:36:36,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:36,857 INFO L93 Difference]: Finished difference Result 25092 states and 58248 transitions. [2018-12-08 23:36:36,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-08 23:36:36,858 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2018-12-08 23:36:36,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:36,882 INFO L225 Difference]: With dead ends: 25092 [2018-12-08 23:36:36,882 INFO L226 Difference]: Without dead ends: 24928 [2018-12-08 23:36:36,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2018-12-08 23:36:36,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24928 states. [2018-12-08 23:36:37,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24928 to 19572. [2018-12-08 23:36:37,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19572 states. [2018-12-08 23:36:37,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19572 states to 19572 states and 46290 transitions. [2018-12-08 23:36:37,074 INFO L78 Accepts]: Start accepts. Automaton has 19572 states and 46290 transitions. Word has length 103 [2018-12-08 23:36:37,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:37,074 INFO L480 AbstractCegarLoop]: Abstraction has 19572 states and 46290 transitions. [2018-12-08 23:36:37,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 23:36:37,074 INFO L276 IsEmpty]: Start isEmpty. Operand 19572 states and 46290 transitions. [2018-12-08 23:36:37,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 23:36:37,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:37,089 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] [2018-12-08 23:36:37,089 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:37,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:37,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1213500156, now seen corresponding path program 1 times [2018-12-08 23:36:37,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:37,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:37,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:37,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:36:37,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:37,155 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-08 23:36:37,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:37,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 23:36:37,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 23:36:37,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 23:36:37,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 23:36:37,156 INFO L87 Difference]: Start difference. First operand 19572 states and 46290 transitions. Second operand 7 states. [2018-12-08 23:36:37,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:37,471 INFO L93 Difference]: Finished difference Result 24705 states and 56832 transitions. [2018-12-08 23:36:37,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 23:36:37,471 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-12-08 23:36:37,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:37,488 INFO L225 Difference]: With dead ends: 24705 [2018-12-08 23:36:37,489 INFO L226 Difference]: Without dead ends: 24705 [2018-12-08 23:36:37,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-08 23:36:37,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24705 states. [2018-12-08 23:36:37,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24705 to 21644. [2018-12-08 23:36:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21644 states. [2018-12-08 23:36:37,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21644 states to 21644 states and 50424 transitions. [2018-12-08 23:36:37,678 INFO L78 Accepts]: Start accepts. Automaton has 21644 states and 50424 transitions. Word has length 103 [2018-12-08 23:36:37,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:37,678 INFO L480 AbstractCegarLoop]: Abstraction has 21644 states and 50424 transitions. [2018-12-08 23:36:37,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 23:36:37,678 INFO L276 IsEmpty]: Start isEmpty. Operand 21644 states and 50424 transitions. [2018-12-08 23:36:37,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 23:36:37,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:37,693 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] [2018-12-08 23:36:37,693 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:37,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:37,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1424851069, now seen corresponding path program 1 times [2018-12-08 23:36:37,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:37,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:37,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:37,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:36:37,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:37,739 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-08 23:36:37,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:37,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 23:36:37,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 23:36:37,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 23:36:37,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 23:36:37,741 INFO L87 Difference]: Start difference. First operand 21644 states and 50424 transitions. Second operand 7 states. [2018-12-08 23:36:38,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:38,191 INFO L93 Difference]: Finished difference Result 26154 states and 60323 transitions. [2018-12-08 23:36:38,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-08 23:36:38,191 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-12-08 23:36:38,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:38,210 INFO L225 Difference]: With dead ends: 26154 [2018-12-08 23:36:38,211 INFO L226 Difference]: Without dead ends: 26154 [2018-12-08 23:36:38,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-12-08 23:36:38,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26154 states. [2018-12-08 23:36:38,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26154 to 22362. [2018-12-08 23:36:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22362 states. [2018-12-08 23:36:38,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22362 states to 22362 states and 52047 transitions. [2018-12-08 23:36:38,427 INFO L78 Accepts]: Start accepts. Automaton has 22362 states and 52047 transitions. Word has length 103 [2018-12-08 23:36:38,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:38,427 INFO L480 AbstractCegarLoop]: Abstraction has 22362 states and 52047 transitions. [2018-12-08 23:36:38,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 23:36:38,427 INFO L276 IsEmpty]: Start isEmpty. Operand 22362 states and 52047 transitions. [2018-12-08 23:36:38,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 23:36:38,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:38,444 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] [2018-12-08 23:36:38,445 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:38,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:38,445 INFO L82 PathProgramCache]: Analyzing trace with hash 914316892, now seen corresponding path program 1 times [2018-12-08 23:36:38,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:38,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:38,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:38,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:36:38,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:38,483 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-08 23:36:38,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:38,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 23:36:38,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 23:36:38,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 23:36:38,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 23:36:38,484 INFO L87 Difference]: Start difference. First operand 22362 states and 52047 transitions. Second operand 4 states. [2018-12-08 23:36:38,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:38,644 INFO L93 Difference]: Finished difference Result 22506 states and 52407 transitions. [2018-12-08 23:36:38,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 23:36:38,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-08 23:36:38,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:38,660 INFO L225 Difference]: With dead ends: 22506 [2018-12-08 23:36:38,660 INFO L226 Difference]: Without dead ends: 22474 [2018-12-08 23:36:38,660 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-08 23:36:38,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22474 states. [2018-12-08 23:36:38,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22474 to 21413. [2018-12-08 23:36:38,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21413 states. [2018-12-08 23:36:38,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21413 states to 21413 states and 49930 transitions. [2018-12-08 23:36:38,831 INFO L78 Accepts]: Start accepts. Automaton has 21413 states and 49930 transitions. Word has length 103 [2018-12-08 23:36:38,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:38,831 INFO L480 AbstractCegarLoop]: Abstraction has 21413 states and 49930 transitions. [2018-12-08 23:36:38,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 23:36:38,831 INFO L276 IsEmpty]: Start isEmpty. Operand 21413 states and 49930 transitions. [2018-12-08 23:36:38,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 23:36:38,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:38,846 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] [2018-12-08 23:36:38,846 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:38,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:38,846 INFO L82 PathProgramCache]: Analyzing trace with hash -882634467, now seen corresponding path program 1 times [2018-12-08 23:36:38,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:38,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:38,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:38,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:36:38,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:38,953 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-08 23:36:38,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:38,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 23:36:38,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 23:36:38,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 23:36:38,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-08 23:36:38,954 INFO L87 Difference]: Start difference. First operand 21413 states and 49930 transitions. Second operand 10 states. [2018-12-08 23:36:39,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:39,307 INFO L93 Difference]: Finished difference Result 23849 states and 55578 transitions. [2018-12-08 23:36:39,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 23:36:39,307 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2018-12-08 23:36:39,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:39,310 INFO L225 Difference]: With dead ends: 23849 [2018-12-08 23:36:39,310 INFO L226 Difference]: Without dead ends: 4150 [2018-12-08 23:36:39,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-12-08 23:36:39,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4150 states. [2018-12-08 23:36:39,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4150 to 4148. [2018-12-08 23:36:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4148 states. [2018-12-08 23:36:39,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4148 states to 4148 states and 9868 transitions. [2018-12-08 23:36:39,335 INFO L78 Accepts]: Start accepts. Automaton has 4148 states and 9868 transitions. Word has length 103 [2018-12-08 23:36:39,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:39,335 INFO L480 AbstractCegarLoop]: Abstraction has 4148 states and 9868 transitions. [2018-12-08 23:36:39,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 23:36:39,336 INFO L276 IsEmpty]: Start isEmpty. Operand 4148 states and 9868 transitions. [2018-12-08 23:36:39,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 23:36:39,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:39,338 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] [2018-12-08 23:36:39,338 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:39,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:39,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1609537170, now seen corresponding path program 1 times [2018-12-08 23:36:39,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:39,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:39,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:39,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:36:39,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:39,384 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-08 23:36:39,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:39,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 23:36:39,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 23:36:39,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 23:36:39,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 23:36:39,385 INFO L87 Difference]: Start difference. First operand 4148 states and 9868 transitions. Second operand 7 states. [2018-12-08 23:36:39,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:39,583 INFO L93 Difference]: Finished difference Result 4827 states and 11336 transitions. [2018-12-08 23:36:39,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 23:36:39,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-12-08 23:36:39,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:39,586 INFO L225 Difference]: With dead ends: 4827 [2018-12-08 23:36:39,586 INFO L226 Difference]: Without dead ends: 4827 [2018-12-08 23:36:39,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-08 23:36:39,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4827 states. [2018-12-08 23:36:39,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4827 to 4090. [2018-12-08 23:36:39,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4090 states. [2018-12-08 23:36:39,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4090 states to 4090 states and 9750 transitions. [2018-12-08 23:36:39,617 INFO L78 Accepts]: Start accepts. Automaton has 4090 states and 9750 transitions. Word has length 103 [2018-12-08 23:36:39,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:39,617 INFO L480 AbstractCegarLoop]: Abstraction has 4090 states and 9750 transitions. [2018-12-08 23:36:39,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 23:36:39,617 INFO L276 IsEmpty]: Start isEmpty. Operand 4090 states and 9750 transitions. [2018-12-08 23:36:39,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 23:36:39,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:39,620 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] [2018-12-08 23:36:39,620 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:39,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:39,620 INFO L82 PathProgramCache]: Analyzing trace with hash -571627731, now seen corresponding path program 2 times [2018-12-08 23:36:39,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:39,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:39,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:39,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:36:39,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:36:39,726 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-08 23:36:39,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:36:39,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 23:36:39,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 23:36:39,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 23:36:39,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-08 23:36:39,727 INFO L87 Difference]: Start difference. First operand 4090 states and 9750 transitions. Second operand 13 states. [2018-12-08 23:36:40,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:36:40,137 INFO L93 Difference]: Finished difference Result 6481 states and 15195 transitions. [2018-12-08 23:36:40,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 23:36:40,137 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 103 [2018-12-08 23:36:40,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:36:40,140 INFO L225 Difference]: With dead ends: 6481 [2018-12-08 23:36:40,140 INFO L226 Difference]: Without dead ends: 4645 [2018-12-08 23:36:40,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-12-08 23:36:40,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4645 states. [2018-12-08 23:36:40,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4645 to 4145. [2018-12-08 23:36:40,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4145 states. [2018-12-08 23:36:40,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4145 states to 4145 states and 9811 transitions. [2018-12-08 23:36:40,168 INFO L78 Accepts]: Start accepts. Automaton has 4145 states and 9811 transitions. Word has length 103 [2018-12-08 23:36:40,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:36:40,168 INFO L480 AbstractCegarLoop]: Abstraction has 4145 states and 9811 transitions. [2018-12-08 23:36:40,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 23:36:40,168 INFO L276 IsEmpty]: Start isEmpty. Operand 4145 states and 9811 transitions. [2018-12-08 23:36:40,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 23:36:40,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:36:40,171 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] [2018-12-08 23:36:40,171 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:36:40,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:36:40,171 INFO L82 PathProgramCache]: Analyzing trace with hash -158775317, now seen corresponding path program 3 times [2018-12-08 23:36:40,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:36:40,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:36:40,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:40,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 23:36:40,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:36:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 23:36:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 23:36:40,218 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 23:36:40,308 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 23:36:40,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 11:36:40 BasicIcfg [2018-12-08 23:36:40,310 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 23:36:40,310 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 23:36:40,310 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 23:36:40,310 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 23:36:40,311 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:35:45" (3/4) ... [2018-12-08 23:36:40,313 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 23:36:40,417 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_98c3fdcf-537c-45bc-9f0e-3abbc9b4bfb1/bin-2019/uautomizer/witness.graphml [2018-12-08 23:36:40,418 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 23:36:40,418 INFO L168 Benchmark]: Toolchain (without parser) took 55670.07 ms. Allocated memory was 1.0 GB in the beginning and 7.1 GB in the end (delta: 6.0 GB). Free memory was 950.6 MB in the beginning and 3.1 GB in the end (delta: -2.2 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2018-12-08 23:36:40,419 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 23:36:40,420 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -138.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-08 23:36:40,420 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 23:36:40,420 INFO L168 Benchmark]: Boogie Preprocessor took 20.65 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 23:36:40,420 INFO L168 Benchmark]: RCFGBuilder took 395.82 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: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. [2018-12-08 23:36:40,420 INFO L168 Benchmark]: TraceAbstraction took 54739.44 ms. Allocated memory was 1.1 GB in the beginning and 7.1 GB in the end (delta: 5.9 GB). Free memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2018-12-08 23:36:40,421 INFO L168 Benchmark]: Witness Printer took 107.52 ms. Allocated memory is still 7.1 GB. Free memory was 3.2 GB in the beginning and 3.1 GB in the end (delta: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. [2018-12-08 23:36:40,422 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 368.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -138.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.65 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 395.82 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: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 54739.44 ms. Allocated memory was 1.1 GB in the beginning and 7.1 GB in the end (delta: 5.9 GB). Free memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. * Witness Printer took 107.52 ms. Allocated memory is still 7.1 GB. Free memory was 3.2 GB in the beginning and 3.1 GB in the end (delta: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L686] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L688] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L689] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L690] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L691] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L692] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L693] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L694] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L695] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L696] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L697] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L698] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L699] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L700] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] -1 pthread_t t1729; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] FCALL, FORK -1 pthread_create(&t1729, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] -1 pthread_t t1730; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] FCALL, FORK -1 pthread_create(&t1730, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L737] 0 y$w_buff1 = y$w_buff0 [L738] 0 y$w_buff0 = 1 [L739] 0 y$w_buff1_used = y$w_buff0_used [L740] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L743] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L744] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L745] 0 y$r_buff0_thd2 = (_Bool)1 [L748] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L749] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L750] 0 y$flush_delayed = weak$$choice2 [L751] 0 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 0 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L753] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L754] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L755] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L755] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L756] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 0 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 0 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L758] EXPR 0 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L758] 0 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L759] 0 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 0 y = y$flush_delayed ? y$mem_tmp : y [L761] 0 y$flush_delayed = (_Bool)0 [L764] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] EXPR 0 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=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L706] 1 x = 1 [L709] 1 __unbuffered_p0_EAX = x [L712] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L713] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L714] 1 y$flush_delayed = weak$$choice2 [L715] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L717] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L718] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L719] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L720] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L721] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L722] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L723] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y = y$flush_delayed ? y$mem_tmp : y [L725] 1 y$flush_delayed = (_Bool)0 [L730] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 0 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 [L770] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] EXPR 0 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 0 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 [L774] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] -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) [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] -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 [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] -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 [L805] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 284 locations, 3 error locations. UNSAFE Result, 54.6s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 17.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11134 SDtfs, 12187 SDslu, 27703 SDs, 0 SdLazy, 10087 SolverSat, 577 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 75 SyntacticMatches, 25 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=201216occurred in iteration=6, 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: 29.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 443667 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2613 NumberOfCodeBlocks, 2613 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2480 ConstructedInterpolants, 0 QuantifiedInterpolants, 491356 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...